485 search results - page 19 / 97 » Iterative Bounding LAO |
NIPS
2004
14 years 11 months ago
2004
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
AAAI
2000
14 years 11 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
MACOM
2010
14 years 4 months ago
2010
One of the applications of wireless sensor networks currently undergoing active research focuses on the scenario where the information generated by a data source S is simultaneousl...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
ALT
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...