10988 search results - page 152 / 2198 » Algorithmic Folding Complexity |
103
click to vote
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
DCT-based CODECs such as MPEG-4 Visual and H.263 "skip" many macroblocks during encoding of typical video sequences (i.e. no coded data is transmitted for these macroblo...
134
click to vote
ICASSP
2009
IEEE
15 years 10 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...
125
click to vote
APPROX
2004
Springer
15 years 7 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...
138
click to vote
ENDM
2010
15 years 3 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...
95
Voted
IANDC
2010
15 years 1 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...