Sciweavers

990 search results - page 152 / 198
» Evolving kernels for support vector machine classification
Sort
View
ICPR
2008
IEEE
15 years 6 months ago
A fast revised simplex method for SVM training
Active set methods for training the Support Vector Machines (SVM) are advantageous since they enable incremental training and, as we show in this research, do not exhibit exponent...
Christopher Sentelle, Georgios C. Anagnostopoulos,...
COLT
2004
Springer
15 years 5 months ago
Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results
One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be u...
Peter L. Bartlett, Ambuj Tewari
89
Voted
CVPR
2010
IEEE
15 years 4 months ago
An Efficient Divide-and-Conquer Cascade for Nonlinear Object Detection
We introduce a method to accelerate the evaluation of object detection cascades with the help of a divide-andconquer procedure in the space of candidate regions. Compared to the e...
Christoph Lampert
57
Voted
LREC
2010
146views Education» more  LREC 2010»
15 years 1 months ago
The Influence of the Utterance Length on the Recognition of Aged Voices
This paper addresses the recognition of elderly callers based on short and narrow-band utterances, which are typical for Interactive Voice Response (IVR) systems. Our study is bas...
Alexander Schmitt, Tim Polzehl, Wolfgang Minker, J...
JMLR
2006
89views more  JMLR 2006»
14 years 11 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel