Sciweavers

159 search results - page 18 / 32
» Geometric Bounds for Generalization in Boosting
Sort
View
COMPGEOM
2003
ACM
14 years 19 days ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
GIS
2000
ACM
13 years 11 months ago
Metric operations on fuzzy spatial objects in databases
Uncertainty management for geometric data is currently an important problem for (extensible) databases in general and for spatial databases, image databases, and GIS in particular...
Markus Schneider
COMPGEOM
2009
ACM
14 years 1 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
CVPR
2004
IEEE
14 years 9 months ago
Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
Kun Huang, René Vidal, Yi Ma
COLOGNETWENTE
2010
13 years 6 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak