Sciweavers

441 search results - page 45 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 10 months ago
Efficient Sketches for the Set Query Problem
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
Eric Price
CISS
2010
IEEE
14 years 1 months ago
Turbo reconstruction of structured sparse signals
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
Philip Schniter
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
14 years 9 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
CIKM
2008
Springer
14 years 12 months ago
Identifying table boundaries in digital documents via sparse line detection
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
Ying Liu, Prasenjit Mitra, C. Lee Giles
ICIP
2004
IEEE
15 years 11 months ago
Estimating facial pose from a sparse representation
We present an approach to estimate the poses of human heads in natural scenes. The essential features for estimating the head pose are the positions of the prominent facial featur...
Hankyu Moon, M. L. Miller