The paper analyzes current research and the state of the industry to assess the complexity of machine learning algorithms. The tasks of deep learning are associated with an extremely high degree of computational
Our results, together with some previously known ones, shed light on the organization of the complexity hierarchy that exists when dynamic problems are classified according to their incremental complexity with respect to locally persistent algorithms. In particular, these results separate the classes of ...
core, and the nucleolus, distinguishing those that are polynomial-time computable from those that are NP-hard or coNP-hard, and providing pseudopolynomial and approximation algorithms for some of the computationally hard problems. Keywords Weighted voting games · Core · Least core · Nucleolus ...
The Inverse Chirp Z-Transform (ICZT) is a generalization of the Inverse Fast Fourier Transform (IFFT), which is one of the most popular and useful algorithms1,2. The sampling points used by the ICZT are distributed along a logarithmic spiral contour in the complex plane. The shape of this...
The performance of the IHBO-based method was evaluated on the CEC’2020 test suite and compared against seven well-known metaheuristic algorithms including the basic HBO, salp swarm algorithm, moth flame optimization, gray wolf optimization, sine cosine algorithm, harmony search optimization, and ...
These algorithms attempt to deal with the computational complexity of the scheduling problem in a number of contexts (online v/s offline, with battery swap or battery charge, small-sized or large problems). Thus, we first recast the scheduling problem as a max-flow problem whose solution lets...
The emergence of such large data sets underscores the importance of algorithms for large-scale haplotyping. Common haplotyping approaches first partition the SNPs into blocks of high linkage-disequilibrium, and then infer haplotypes for each block separately. We investigate an integrated haplotyping ...
algorithms where NR is performed first and then AFC the estimation of the feedback path is usually affected by the NR stage, it is shown here that by performing a rank-2 approximation of the speech correlation matrix this issue can be avoided and the feedback path can be correctly estimated...
Algorithmic Complexity Algorithms Algorithm Analysis and Problem Complexity Complexity Computational Complexity Theoretical Linguistics / Grammar Use our pre-submission checklist Avoid common mistakes on your manuscript. 1 Introduction Context-free grammars are among the most classical concepts in theor...
For image encryption algorithm based on the chaotic system, the performance of the chaotic mapping is the core of the encryption system. In all the chaotic image encryption algorithms, 1D chaotic mapping has fewer parameters and variables, and its phase space trajectory is simpler than high-dimensi...