225 search results - page 27 / 45 » Kernel Basis Pursuit |
132
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an 1-regularized linear regression prob...
126
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of learning a coefficient vector x0 ∈ RN from noisy linear observation y = Ax0 + w ∈ Rn . In many contexts (ranging from model selection to image proce...
154
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
235
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
140
Voted
QRE
2008
15 years 2 months ago
2008
: Kriging-based exploration strategies often rely on a single Ordinary Kriging model which parametric covariance kernel is selected a priori or on the basis of an initial data set....