Sciweavers

38 search results - page 8 / 8
» Visibility Computations: From Discrete Algorithms to Real Al...
Sort
View
COMPGEOM
2005
ACM
14 years 21 days ago
Kinetic sorting and kinetic convex hulls
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...
Mohammad Ali Abam, Mark de Berg
COMPGEOM
2004
ACM
14 years 4 months ago
A 2D kinetic triangulation with near-quadratic topological changes
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 ...
Pankaj K. Agarwal, Yusu Wang, Hai Yu
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 11 months ago
Polynomial Learning of Distribution Families
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
Mikhail Belkin, Kaushik Sinha