Sciweavers

400 search results - page 9 / 80
» Approximation Stability and Boosting
Sort
View
COLT
2005
Springer
15 years 3 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...
MOC
2002
101views more  MOC 2002»
14 years 9 months ago
On the stability of a family of finite element methods for hyperbolic problems
We consider a family of tensor product finite element methods for hyperbolic equations in RN , N 2, which are explicit and generate a continuous approximate solution. The base cas...
Gerard R. Richter
JSCIC
2010
145views more  JSCIC 2010»
14 years 4 months ago
Interior Penalty Continuous and Discontinuous Finite Element Approximations of Hyperbolic Equations
In this paper we present the continuous and discontinuous Galerkin methods in a unified setting for the numerical approximation of the transport dominated advection-reaction equati...
Erik Burman, Alfio Quarteroni, Benjamin Stamm
NIPS
1994
14 years 10 months ago
Boosting the Performance of RBF Networks with Dynamic Decay Adjustment
Radial Basis Function (RBF) Networks, also known as networks of locally{tuned processing units (see 6]) are well known for their ease of use. Most algorithms used to train these t...
Michael R. Berthold, Jay Diamond
AICT
2005
IEEE
194views Communications» more  AICT 2005»
15 years 3 months ago
Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
Claus Bauer