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 complexity, which requires the use, first of all, of new algorithmic methods and an ...
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 ...
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 ...
Proportional Nested Deficit Round Robin: Improving the Latency of Packet Scheduler with an O(1) Complexity In recent years, many fair Packet scheduling algorithms have been proposed for switches and routers to provide the Quality of Service (QoS) guarantees requ... A Shiravi,YG Kim,PS Min - ...
摘要: The order of the computational complexity of the EMD is equivalent to FFT.Optimized program is proposed to speed up the computation of EMD up to 1000 times.Fast HHT with optimized EMD/EEMD algorithm can operate in real-time.关键词:...
Non-uniform design limits the widespread adoption of CMOS chips and increases the design cost of ASICs for the Ising model. AI (Artificial Intelligence) chips have numerous computing resources, which are used for training and infer- ence of various AI algorithms. and serve as valuable resources ...
For grammar-based compression, the central computational problem is that of computing a smallest (or at least small) grammar for a given word, which is called the smallest grammar problem,Footnote 5 and the respective literature is mainly about approximation algorithms:Footnote 6LZ78 [35], LZW [...
2020Pump Up the Volume: Processing Large Data on GPUs with Fast Interconnects 2019Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation 2019Interventional Fairness : Causal Database Repair for Algorithmic Fairness 2019On the Enumeration Complexity of Unions of Conjunctive Queries ...
The average complexity for searching a record in a sorted file of records that are stored on a tape is analyzed for four search algorithms, namely, sequential search, binary search, Fibonacci search, and a modified version of Fibonacci search. The theoretical results are consistent with the recen...
of computation are sought. Typical but not exclusive topics of interest include algorithms and data structures, computational complexity, randomness in computing, algorithmic graph theory and combinatorics, analysis of Boolean functions, approximation algorithms, cryptography, computational learning theory, ...