Algorithms and complexity
ALGORITHMS AND COMPLEXITY
... Design and implement strategies for efficient algorithms to solve different types of problems. Competences Degree Competences GII-FB3. Capacity to understand and master the basic concepts of discreet mathematics, ...
Adaptive Learning: Algorithms and Complexity
... standard algorithms such as empirical risk minimization do not suffice to achieve this ...Rademacher complexity regret bound is achievable if and only if the norm satisfies certain decoupling inequalities ...
391
Revisiting Separation: Algorithms and Complexity
... worst-case complexity of an algorithm that performs either syntactic or semantic separation for any linear temporal logic is still not ...worst-case complexity, but we have been unable to find a proof of ...
40
Matchings with lower quotas : algorithms and complexity
... the complexity of WMLQ from the viewpoints of classical polynomial time algorithms, fixed-parameter tractability, as well as ...efficient algorithms to solve the tractable ...
24
Matchings with lower quotas: algorithms and complexity
... the complexity of WMLQ from the viewpoints of classical polynomial time algorithms, fixed-parameter tractability, as well as ...efficient algorithms to solve the tractable ...
24
Scheduling Real-time Tasks: Algorithms and Complexity
... Feasibility-analysis Algorithms The intractability results of Section ...run-time complexity for periodic task systems with utilization bounded from above — by Corollary 1, exact feasibility analysis of ...
38
Efficient algorithms in quantum query complexity
... query complexity of a variety of problems using several different ...optimal algorithms for the sparse Hamiltonian simulation problem and the problem of simulating the continuous- and fractional-query ...
137
Low complexity MIMO detection algorithms and implementations
... fixed complexity sphere decoder (SFSD) [35] and the soft-output LORD [27] can be viewed as extensions of the breadth-first tree search ...lower complexity than a list-based fixed-complexity ...
123
Cluster-based Kriging approximation algorithms for complexity reduction
... space complexity of Kriging, that is cubic and quadratic in the number of data points respectively, becomes a major bottleneck with more and more data available ...the complexity reduction, called cluster ...
14
Low Complexity Image Recognition Algorithms for Handheld devices
... retrieval algorithms developed during the PhD work are presented in chapter ...The algorithms developed to compensate against any geometrical transformations, due to the camera acquisition of images, like ...
141
Low-Order Optimization Algorithms: Iteration Complexity and Applications
... speaking, algorithms can be classified into three types: (1) the high-order algorithms (which use the information of the Hessian or higher order derivatives of the objective function); (2) the first-order ...
219
Quadratic Bottleneck Problems: Algorithms, complexity and related topics.
... So, a general question that arises would be “For what combinations of F and Φ the COP (or its special cases) is NP-hard, polynomially approximatable or polynomially solvable?” In this thesis, we consider several ...
168
Resampling Algorithms for Particle Filters: A Computational Complexity Perspective
... resampling algorithms for particle filters suitable for real-time implementation are described and their analysis is ...new algorithms reduce the complexity of both hardware and DSP realization ...
11
Repair Checking in Inconsistent Databases: Algorithms and Complexity
... Does the good algorithmic behavior of weakly acyclic sets of tgds extend to the repair checking problem?... Weakly Acyclic Sets of Tgds: Intractability.[r] ...
54
A Algorithms and Complexity for Periodic Real-Time Scheduling
... We complement our negative results for arbitrary periodic tasks with the first con- stant approximation algorithms for two restricted models. We provide a polynomial time (2 − 1/m)-approximate test for ...
19
Many-to-one matchings with lower quotas : algorithms and complexity
... In this paper, we study the computational complexity of wmlq from var- ious perspectives: Firstly, in Sect. 2, we show that the problem can be solved efficiently if the degree of every post is at most 2, whereas the ...
12
Verifying probabilistic systems : new algorithms and complexity results
... time complexity of the algorithm is polynomial in the size of the CTMDP, the unary representation of the cost- bound vector and the reciprocal of the given error bound, and exponential in the dimension of the ...
166
Algorithms and lower bounds in finite automata size complexity
... The standard conjecture that L f NL asserts that a particular nondeterministic finite automaton with a small bunch of states and just two heads that only move one-wa[r] ...
99
DD2352 Algorithms & Complexity Lecture 9: NP-Completeness
... Sat, 3-Sat, Independent Set, Vertex Cover, Set Cover, Hamiltonian Cycle, Travelling Salesman, 3-Coloring, Subset Sum, Knapsack. There are literally thousands upon thousands of other prob[r] ...
22
An Analysis of Low Complexity Algorithms for MIMO Antenna Selection
... I. I NTRODUCTION Given the advantages of wireless Multiple-Input Multiple- Output (MIMO) systems, using transmit (TX) and receive (RX) antenna arrays, much attention has been paid to these systems and their potential ...
6