1765 search results - page 44 / 353 » Combinations of Weak Classifiers |
124
click to vote
HIS
2004
15 years 3 months ago
2004
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
124
Voted
ICALP
1995
Springer
15 years 5 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
116
click to vote
IANDC
2010
15 years 14 days ago
2010
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
139
click to vote
ICCV
2011
IEEE
14 years 1 months ago
2011
IEEE
Weakly supervised discovery of common visual structure in highly variable, cluttered images is a key problem in recognition. We address this problem using deformable part-based mo...
115
click to vote
EUROSYS
2010
ACM
15 years 7 months ago
2010
ACM
Combining access control with weakly consistent replication presents a challenge if the resulting system is to support eventual consistency. If authorization policy can be tempora...