Results 31 to 40 of about 22,856,606 (379)
COMPLEXITY, TIME AND MUSIC [PDF]
Advances in Complex Systems, 2010 The concept of complexity as considered in terms of its algorithmic definition proposed by G. J. Chaitin and A. N. Kolmogorov is revisited for the dynamical complexity of music. When music pieces are cast in the form of time series of pitch variations, concepts of dynamical systems theory can be used to define new quantities such as the dimensionality
openaire +3 more sources
Accurate Estimate of the Advantage of Impossible Differential Attacks
IACR Transactions on Symmetric Cryptology, 2017 Impossible differential attacks, which are taking advantage of differentials that cannot occur, are powerful attacks for block cipher primitives. The power of such attacks is often measured in terms of the advantage — number of key-bits found during the ...
Céline Blondeau
doaj +1 more source
Time Complexity of Decentralized Fixed-Mode Verification [PDF]
, 2010 Given an interconnected system, this note is concerned with the time complexity of verifying whether an unrepeated mode of the system is a decentralized fixed mode (DFM).
Lavaei, Javad, Sojoudi, Somayeh
core +1 more source
Towards a Unified Framework of Matrix Derivatives
IEEE Access, 2018 The need of processing and analyzing massive statistics simultaneously requires the derivatives of matrix-to-scalar functions (scalar-valued functions of matrices) or matrix-to-matrix functions (matrixvalued functions of matrices).
Jianyu Xu +4 more
doaj +1 more source
Shape matching and object recognition using common base triangle area
IET Computer Vision, 2015 Shape matching has always been a key issue in the field of computer vision. To obtain high recognition accuracy with low time complexity and to reduce the influence of contour deformation due to noise in shape matching, a novel shape matching method ...
Dameng Hu +4 more
doaj +1 more source
Verifying Time Complexity of Deterministic Turing Machines [PDF]
, 2014 We show that, for all reasonable functions $T(n)=o(n\log n)$, we can algorithmically verify whether a given one-tape Turing machine runs in time at most $T(n)$. This is a tight bound on the order of growth for the function $T$ because we prove that, for $
Gajser, David
core +1 more source
Time in the Age of Complexity [PDF]
Time & Society, 2007 Technically mediated forms of interconnectivity and communication are sustaining complex arrangements through which are emerging more dynamic and interdependent physical-digital relations. This article examines the intensification of time through the lens of complexity theory and argues that increasingly networked infrastructures are moving towards an
openaire +3 more sources
Timed Parity Games: Complexity and Robustness [PDF]
Logical Methods in Computer Science, 2008 We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \emph{concurrent} in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen.
Chatterjee, Krishnendu +2 more
openaire +8 more sources
Time-Reversibility, Causality and Compression-Complexity [PDF]
Entropy, 2021 Detection of the temporal reversibility of a given process is an interesting time series analysis scheme that enables the useful characterisation of processes and offers an insight into the underlying processes generating the time series. Reversibility detection measures have been widely employed in the study of ecological, epidemiological and ...
Aditi Kathpalia, Nithin Nagaraj
openaire +5 more sources
IEEE Access, 2022 Continuous and low-cost broadcast authentication is a fundamental security service for distributed sensor networks. This paper presents a novel development of a continuous and low-overhead broadcast authentication protocol named enhanced Infinite timed ...
Khouloud Eledlebi +5 more
doaj +1 more source