417 search results - page 44 / 84 » Some Theory for Generalized Boosting Algorithms |
DAARC
2007
Springer
14 years 3 months ago
2007
Springer
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
TPHOL
2007
IEEE
14 years 3 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
COLT
2004
Springer
14 years 2 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
JMLR
2006
13 years 9 months ago
2006
In this work we consider the task of relaxing the i.i.d. assumption in pattern recognition (or classification), aiming to make existing learning algorithms applicable to a wider r...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...