Algorithms and lower bounds for sparse recovery

[摘要] We consider the following k-sparse recovery problem: design a distribution of m x n matrix A, such that for any signal x, given Ax with high probability we can efficiently recover x satisfying IIx - x l,

[发布机构] Massachusetts Institute of Technology