Sparse Recovery Using Sparse Matrices
In this paper, we survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices has several attractive properties: they support algorithms with low computational complexity, and make it easy to perform incremental updates to signals. We discuss applications t...
Main Authors: | Gilbert, Anna (Author), Indyk, Piotr (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers,
2012-05-24T18:31:47Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Sparse Recovery Using Sparse Matrices
by: Gilbert, Anna, et al.
Published: (2021) -
Sparse recovery with partial support knowledge
by: Do Ba, Khanh, et al.
Published: (2012) -
On the Power of Adaptivity in Sparse Recovery
by: Indyk, Piotr, et al.
Published: (2012) -
Lower bounds for sparse recovery
by: Indyk, Piotr, et al.
Published: (2011) -
Sparse Recovery for Earth Mover Distance
by: Gupta, Rishi V., et al.
Published: (2011)