486 search results - page 17 / 98 » Boosting and Hard-Core Sets |
101
Voted
COLT
2001
Springer
15 years 4 months ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
108
click to vote
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
Boosting has been widely applied in computer vision, especially after Viola and Jones's seminal work [23]. The marriage of rectangular features and integral-imageenabled fast...
120
click to vote
PR
2006
15 years 8 days ago
2006
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
119
Voted
CVPR
2007
IEEE
15 years 4 months ago
2007
IEEE
Detection of objects of a given class is important for many applications. However it is difficult to learn a general detector with high detection rate as well as low false alarm r...
171
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
Many semi-supervised learning algorithms only
deal with binary classification. Their extension to the
multi-class problem is usually obtained by repeatedly
solving a set of bina...