3318 search results - page 50 / 664 » The Weak Instance Model |
COLT
2000
Springer
14 years 7 days ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
IJCAI
2007
13 years 9 months ago
2007
We present MBoost, a novel extension to AdaBoost that extends boosting to use multiple weak learners explicitly, and provides robustness to learning models that overfit or are po...
EUSFLAT
2003
13 years 9 months ago
2003
This paper regards the recurrent linguistic rule bases. These systems are considered as relational models with several relations. Such representation allows to use relation algebr...
SOFSEM
2001
Springer
14 years 9 days ago
2001
Springer
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modi...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper, we present a compositional boosting algorithm for detecting and recognizing 17 common image structures in low-middle level vision tasks. These structures, called &q...