15033 search results - page 370 / 3007 » Complexity Theory and Algorithms |
207
Voted
ICASSP
2009
IEEE
16 years 2 months ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
195
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
212
Voted
ENDM
2010
15 years 7 months ago
2010
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
156
Voted
IANDC
2010
15 years 6 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
168
Voted
CCE
2010
15 years 4 months ago
2010
The paper examines the applicability of mathematical programming methods to the simultaneous optimization of the structure and the operational parameters of a combined-cycle-based...