Sciweavers

10051 search results - page 199 / 2011
» A Dynamic Separator Algorithm
Sort
View
ECML
2005
Springer
15 years 10 months ago
Margin-Sparsity Trade-Off for the Set Covering Machine
We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the ...
François Laviolette, Mario Marchand, Mohak ...
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 5 months ago
Dichotic harmony for the musical practice
The dichotic method of hearing sound adapts in the region of musical harmony. The algorithm of the separation of the being dissonant voices into several separate groups is propose...
Vadim R. Madgazin
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
15 years 9 months ago
Application of a simple binary genetic algorithm to a noiseless testbed benchmark
One of the earliest evolutionary computation algorithms, the genetic algorithm, is applied to the noise-free BBOB 2009 testbed. It is adapted to the continuous domain by increasin...
Miguel Nicolau
ICASSP
2008
IEEE
15 years 11 months ago
Some properties of an empirical mode type signal decomposition algorithm
The empirical mode decomposition (EMD) has seen widespread use for analysis of nonlinear and nonstationary time-series. Despite some practical success, it lacks a firm theoretica...
Stephen D. Hawley, Les E. Atlas, Howard J. Chizeck
JMLR
2006
105views more  JMLR 2006»
15 years 5 months ago
Some Theory for Generalized Boosting Algorithms
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
Peter J. Bickel, Yaacov Ritov, Alon Zakai