Sciweavers

281 search results - page 10 / 57
» Group-based learning: a boosting approach
Sort
View
NIPS
2007
13 years 10 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
CVPR
2008
IEEE
14 years 10 months ago
Face alignment via boosted ranking model
Face alignment seeks to deform a face model to match it with the features of the image of a face by optimizing an appropriate cost function. We propose a new face model that is al...
Gianfranco Doretto, Hao Wu, Xiaoming Liu 0002
ACCV
2007
Springer
14 years 2 months ago
Learning a Fast Emulator of a Binary Decision Process
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
Jan Sochman, Jiri Matas
TNN
2010
176views Management» more  TNN 2010»
13 years 3 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
ECCV
2010
Springer
14 years 1 months ago
Robust Multi-View Boosting with Priors
Many learning tasks for computer vision problems can be described by multiple views or multiple features. These views can be exploited in order to learn from unlabeled data, a.k.a....