159 search results - page 16 / 32 » Geometric Bounds for Generalization in Boosting |
SI3D
1999
ACM
13 years 11 months ago
1999
ACM
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
FOCS
1991
IEEE
13 years 11 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
ML
2007
ACM
13 years 6 months ago
2007
ACM
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
COLT
1993
Springer
13 years 11 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
This article examines projectively-invariant local geometric properties of smooth curves and surfaces. Oriented projective differential geometry is proposed as a general framework ...