51 search results - page 2 / 11 » Phase Transitions for Greedy Sparse Approximation Algorithms |
IJCNN
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract— This paper considers the basis vector selection issue invloved in forward selection algorithms to sparse Gaussian Process Regression (GPR). Firstly, we re-examine a pre...
CISS
2010
IEEE
12 years 8 months ago
2010
IEEE
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
ICIP
2007
IEEE
13 years 11 months ago
2007
IEEE
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
TSP
2008
13 years 4 months ago
2008
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...