Sciweavers

63 search results - page 5 / 13
» Improved bounds for dictionary look-up with one error
Sort
View
CORR
2011
Springer
148views Education» more  CORR 2011»
13 years 2 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport
ICML
2004
IEEE
14 years 27 days ago
Towards tight bounds for rule learning
While there is a lot of empirical evidence showing that traditional rule learning approaches work well in practice, it is nearly impossible to derive analytical results about thei...
Ulrich Rückert, Stefan Kramer
SIBGRAPI
2007
IEEE
14 years 1 months ago
Improved Reversible Mapping from Color to Gray
— In the reversible conversion of color images to gray ones, colors are mapped to textures and from the textures the receiver can recover the colors, i.e. one may print a color i...
Ricardo L. de Queiroz
TABLEAUX
2007
Springer
14 years 1 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
CC
2007
Springer
123views System Software» more  CC 2007»
13 years 7 months ago
An Improved Analysis of Linear Mergers
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
Zeev Dvir, Amir Shpilka