107 search results - page 1 / 22 » Lower Bounds for Sparse Recovery |
SODA
2010
ACM
14 years 2 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
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
DSN
2006
IEEE
13 years 10 months ago
2006
IEEE
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...
ICRA
2008
IEEE
13 years 11 months ago
2008
IEEE
— This paper provides a novel state vector and covariance sub-matrix recovery algorithm for a recently developed submap based exactly sparse Extended Information Filter (EIF) SLA...
SPAA
2010
ACM
13 years 5 months ago
2010
ACM