Sciweavers

393 search results - page 8 / 79
» On the Convergence of Boosting Procedures
Sort
View
COLT
2005
Springer
14 years 1 months ago
Margin-Based Ranking Meets Boosting in the Middle
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robe...
NIPS
2001
13 years 8 months ago
Boosting and Maximum Likelihood for Exponential Models
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
Guy Lebanon, John D. Lafferty
EUSFLAT
2007
13 years 9 months ago
Using Quasiarithmetic Means in a Sequential Decision Procedure
We study in this paper the following sequential decision procedure. First, the members of a group show their opinions on all the members, regarding a specific attribute. Taking i...
Miguel A. Ballester, José Luis Garcí...
ISLPED
1997
ACM
106views Hardware» more  ISLPED 1997»
13 years 11 months ago
A sequential procedure for average power analysis of sequential circuits
A new statistical technique for average power estimation in sequential circuits is presented. Due to the feedback mechanism, conventional statistical procedures cannot be applied ...
Li-Pen Yuan, Sung-Mo Kang
IFIP
2010
Springer
13 years 2 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro