2517 search results - page 40 / 504 » Specifying Weak Sets |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on ...
BSL
2005
14 years 11 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
COLT
2001
Springer
15 years 4 months ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
KBS
2002
14 years 11 months ago
2002
We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set. Using this rule set instead o...
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Conventional contour tracking algorithms with level set often use generative models to construct the energy function. For tracking through cluttered and noisy background, however,...