Sciweavers

SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 2 months ago
Lower Bounds for Sparse Recovery
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