495 search results - page 19 / 99 » Sparse representation algorithms based on mean-field approxi... |
105
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Sparse signal representation based on overcomplete dictionaries has recently been extensively investigated, rendering the state-of-the-art results in signal, image and video proce...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper analyzes the performance of the simple thresholding algorithm for sparse signal representations. In particular, in order to be more realistic we introduce a new probabi...
SODA
2012
ACM
13 years 14 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
TSP
2010
14 years 4 months ago
2010
We propose a variance-component probabilistic model for sparse signal reconstruction and model selection. The measurements follow an underdetermined linear model, where the unknown...