Sciweavers

10608 search results - page 95 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
RTSS
2000
IEEE
14 years 1 months ago
Efficient Scheduling of Sporadic, Aperiodic, and Periodic Tasks with Complex Constraints
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
Damir Isovic, Gerhard Fohler
ICIP
2004
IEEE
14 years 11 months ago
Video encoder complexity reduction by estimating skip mode distortion
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...
Iain E. Garden Richardson, Yafan Zhao
ICASSP
2009
IEEE
14 years 4 months ago
A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries
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...
Boris Mailhé, Rémi Gribonval, Fr&eac...
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
14 years 1 months ago
The Sketching Complexity of Pattern Matching
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...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
ENDM
2010
87views more  ENDM 2010»
13 years 10 months ago
Euler Complexes (Oiks)
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...
Jack Edmonds