495 search results - page 72 / 99 » Approximation algorithms for budgeted learning problems |
112
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
Subspace learning techniques are widespread in pattern recognition research. They include PCA, ICA, LPP, etc. These techniques are generally linear and unsupervised. The problem o...
99
Voted
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
108
Voted
SEAL
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Paret...
91
Voted
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Markov Random Field, or MRF, models are a powerful tool for modeling images. While much progress has been made in algorithms for inference in MRFs, learning the parameters of an M...
111
click to vote
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...