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...
—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...
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...
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...
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...