441 search results - page 43 / 89 » Sparse Recovery Using Sparse Random Matrices |
145
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
134
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...
155
Voted
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
137
click to vote
ALT
2011
Springer
14 years 13 days ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
104
click to vote
EUROPAR
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...