296 search results - page 9 / 60 » Kernel Matching Pursuit |
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
This paper presents a novel method for reducing the dimensionality of kernel spaces. Recently, to maintain the convexity of training, loglinear models without mixtures have been u...
115
click to vote
TIT
2008
14 years 11 months ago
2008
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
Abstract. Two new techniques based on nonparametric estimation of probability densities are introduced which improve on the performance of equivalent robust methods currently emplo...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...