Sciweavers

10054 search results - page 145 / 2011
» On the Complexity of Function Learning
Sort
View
92
Voted
COLT
1993
Springer
15 years 4 months ago
Learning from a Population of Hypotheses
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
Michael J. Kearns, H. Sebastian Seung
CVPR
2009
IEEE
1528views Computer Vision» more  CVPR 2009»
16 years 4 months ago
Structured Output-Associative Regression
Structured outputs such as multidimensional vectors or graphs are frequently encountered in real world pattern recognition applications such as computer vision, natural language pr...
Liefeng Bo and Cristian Sminchisescu
92
Voted
ACCV
2006
Springer
15 years 6 months ago
Waterfall Segmentation of Complex Scenes
Abstract. We present an image segmentation technique using the morphological Waterfall algorithm. Improvements in the segmentation are brought about by using improved gradients. Th...
Allan Hanbury, Beatriz Marcotegui
JMLR
2006
150views more  JMLR 2006»
15 years 17 days ago
Building Support Vector Machines with Reduced Classifier Complexity
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
S. Sathiya Keerthi, Olivier Chapelle, Dennis DeCos...
ECCV
2008
Springer
16 years 2 months ago
Feature Correspondence Via Graph Matching: Models and Global Optimization
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...