2988 search results - page 111 / 598 » Experiments with a New Boosting Algorithm |
158
click to vote
MCS
2000
Springer
15 years 8 months ago
2000
Springer
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
155
click to vote
TIP
2010
15 years 3 months ago
2010
—We address the problem of face recognition by matching image sets. Each set of face images is represented by a subspace (or linear manifold) and recognition is carried out by su...
130
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
114
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper deals with the problem of finding the optimal sequence of sub-word unit HMMs for a number of given utterances of a word. For this problem we present a new solution bas...
117
click to vote
SIGKDD
2000
15 years 4 months ago
2000
This paper presents a simple new algorithm that performs k-means clustering in one scan of a dataset, while using a bu er for points from the dataset of xed size. Experiments show...