2988 search results - page 265 / 598 » Experiments with a New Boosting Algorithm |
128
click to vote
ICDAR
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper describes a new hybrid architecture for an artificial neural network classifier that enables incremental learning. The learning algorithm of the proposed architecture d...
131
click to vote
EMMCVPR
1999
Springer
15 years 8 months ago
1999
Springer
Consider the problem of tting a nite Gaussian mixture, with an unknown number of components, to observed data. This paper proposes a new minimum description length (MDL) type crite...
116
click to vote
AIPS
2010
15 years 6 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
113
click to vote
AAAI
2008
15 years 6 months ago
2008
This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages-...
134
Voted
CG
2008
Springer
15 years 6 months ago
2008
Springer
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...