2509 search results - page 361 / 502 » Abstract Geometrical Computation and Computable Analysis |
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
MICCAI
1998
Springer
14 years 2 months ago
1998
Springer
The cortex is the outermost thin layer of gray matter in the brain; geometric measurement of the cortex helps in understanding brain anatomy and function. In the quantitative analy...
COLT
1993
Springer
14 years 2 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...
AC
2003
Springer
14 years 1 months ago
2003
Springer
In this paper two methods for human face recognition and the influence of location mistakes are shown. First one, Principal Components Analysis (PCA), has been one of the most appl...