64 search results - page 2 / 13 » Locally Competitive Algorithms for Sparse Approximation |
ATAL
2010
Springer
15 years 21 days ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
IJCV
2008
14 years 11 months ago
2008
We investigate the role of sparsity and localized features in a biologically-inspired model of visual object classification. As in the model of Serre, Wolf, and Poggio, we first a...
105
click to vote
COLT
2010
Springer
14 years 9 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
102
click to vote
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
117
click to vote
IPSN
2009
Springer
15 years 6 months ago
2009
Springer
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...