3415 search results - page 70 / 683 » Lower Bounds for Kernelizations |
59
Voted
SODA
2010
ACM
15 years 10 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
75
Voted
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
65
Voted
ICCD
2001
IEEE
15 years 9 months ago
2001
IEEE
81
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
101
Voted
ICALP
2009
Springer
15 years 7 months ago
2009
Springer
