51 search results - page 3 / 11 » Phase Transitions for Greedy Sparse Approximation Algorithms |
SIGPRO
2011
14 years 4 months ago
2011
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
77
Voted
ISCIS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In this paper, we study the problem of placing limited number of wavelength converting nodes in a multi-fiber network with static traffic demands and propose a tabu sear...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
79
Voted
ML
2006
ACM
14 years 9 months ago
2006
ACM
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
114
Voted
TIT
2010
14 years 4 months ago
2010
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...