Sciweavers

129 search results - page 3 / 26
» Uniform deterministic dictionaries
Sort
View
ICASSP
2010
IEEE
13 years 10 months ago
Coherence-based near-oracle performance guarantees for sparse estimation under Gaussian noise
We consider the problem of estimating a deterministic sparse vector x0 from underdetermined measurements Ax0 + w, where w represents white Gaussian noise and A is a given determin...
Zvika Ben-Haim, Yonina C. Eldar, Michael Elad
GIL
2009
13 years 7 months ago
The Need for Content-lists, Dictionaries and Ontologies in Expressing and Evaluating Compliance to Crop-production Regulations,
: Regulations and standards are playing an increasingly important role in crop production. Common to the vast majority of these is that they are written in a natural language which...
Edward Nash
STACS
2004
Springer
14 years 3 months ago
Optimal and Online Preemptive Scheduling on Uniformly Related Machines
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
Tomás Ebenlendr, Jiri Sgall
APPROX
2010
Springer
120views Algorithms» more  APPROX 2010»
13 years 11 months ago
Uniform Derandomization from Pathetic Lower Bounds
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
Eric Allender, Vikraman Arvind, Fengming Wang
WIA
2001
Springer
14 years 2 months ago
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
Jorge Graña, Francisco-Mario Barcala, Migue...