Sciweavers

159 search results - page 14 / 32
» Incremental One-Class Learning with Bounded Computational Co...
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
JMLR
2002
106views more  JMLR 2002»
13 years 7 months ago
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
Prasanth B. Nair, Arindam Choudhury 0002, Andy J. ...
FOCS
1995
IEEE
13 years 11 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
CVPR
2007
IEEE
13 years 11 months ago
Improving Part based Object Detection by Unsupervised, Online Boosting
Detection of objects of a given class is important for many applications. However it is difficult to learn a general detector with high detection rate as well as low false alarm r...
Bo Wu, Ram Nevatia
CVGIP
2010
182views more  CVGIP 2010»
13 years 7 months ago
MCCD: Multi-core collision detection between deformable models using front-based decomposition
We present a novel parallel algorithm for fast continuous collision detection (CCD) between deformable models using multi-core processors. We use a hierarchical representation to ...
Min Tang, Dinesh Manocha, Ruofeng Tong