3415 search results - page 70 / 683 » Lower Bounds for Kernelizations |
84
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
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
91
Voted
ICCD
2001
IEEE
16 years 26 days ago
2001
IEEE
113
Voted
STACS
2010
Springer
15 years 11 months ago
2010
Springer
132
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
