2188 search results - page 264 / 438 » Instance-Optimal Geometric Algorithms |
116
click to vote
COLT
2008
Springer
15 years 5 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
123
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
132
Voted
WAE
1998
15 years 4 months ago
1998
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
116
Voted
COMGEO
2008
ACM
15 years 3 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
119
click to vote
COMPUTING
2007
15 years 3 months ago
2007
In this paper a class of subdivision schemes generalizing the algorithm of Loop is presented. The stencils have the same support as those from the algorithm of Loop, but allow a v...