Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

74

SODA
2010
ACM

190views Algorithms» more SODA 2010»

Lower Bounds for Sparse Recovery

16 years 7 days ago

Lower Bounds for Sparse Recovery

Download www.almaden.ibm.com

We consider the following k-sparse recovery problem: design an m ? n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying

khanh do ba, piotr indyk, eric price

Real-time Traffic

Discrete Algorithms | Signal X | SODA 2010 |

claim paper

Related Content

» NearOptimal Sparse Recovery in the L1 Norm

» Automatic Recovery Using Bounded Partially Observable Markov Decision Processes

» Exact state and covariance submatrix recovery for submap based sparse EIF SLAM algorithm

» Brief announcement Lower bounds on communication for sparse Cholesky factorization of a mo...

» Lower bounds for sparse matrix vector multiplication on hypercubic networks

» Universal Measurement Bounds for Structured Sparse Signal Recovery

» Average case analysis of sparse recovery with thresholding New bounds based on average di...

» Bounded gradient projection methods for sparse signal recovery

» Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	khanh do ba, piotr indyk, eric price

Comments (0)