Sciweavers

3415 search results - page 70 / 683
» Lower Bounds for Kernelizations
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 3 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