Lower bounds for sparse recovery

Lower bounds for sparse recovery

We consider the following k-sparse recovery problem: design an m x n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying x|| ^x||1 [less than or equal to] C min[subscript k]-sparse x'||x - x'||1. It is known that there exist matrices A with this property...

Full description

Bibliographic Details
Main Authors: Indyk, Piotr (Contributor), Do Ba, Khanh (Contributor), Price, Eric C. (Contributor), Woodruff, David P. (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Society for Industrial and Applied Mathematics, 2011-05-10T15:40:10Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items