20 search results - page 3 / 4 » Compressed sensing - a look beyond linear programming |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Takens' Embedding Theorem remarkably established that concatenating M previous outputs of a dynamical system into a vector (called a delay coordinate map) can be a one-to-one...
SIAMREV
2010
13 years 1 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
ICASSP
2008
IEEE
14 years 24 days ago
2008
IEEE
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
STOC
2009
ACM
14 years 7 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...