16188 search results - page 10 / 3238 » The Optimal PAC Algorithm |
ECCC
2006
13 years 7 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
COLT
2001
Springer
14 years 4 hour ago
2001
Springer
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
The standard approach for learning Markov Models with Hidden State uses the Expectation-Maximization framework. While this approach had a significant impact on several practical ap...
AI
2002
Springer
13 years 7 months ago
2002
Springer
Most classification algorithms are "passive", in that they assign a class label to each instance based only on the description given, even if that description is incompl...
PACS
2000
Springer
13 years 11 months ago
2000
Springer
Dynamic voltage and frequency scaling has been identified as one of the most effective ways to reduce power dissipation. This paper discusses a compilation strategy that identifies...