38 search results - page 8 / 8 » Visibility Computations: From Discrete Algorithms to Real Al... |
COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...