141 search results - page 28 / 29 » Self-improving Algorithms for Convex Hulls |
122
click to vote
PAMI
2000
15 years 3 months ago
2000
I consider the problem of finding all the modes of a mixture of multivariate Gaussian distributions, which has applications in clustering and regression. I derive exact formulas f...
214
click to vote
CAD
2011
Springer
14 years 11 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
109
click to vote
SODA
1994
ACM
15 years 5 months ago
1994
ACM
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
163
click to vote
SIGGRAPH
1998
ACM
15 years 8 months ago
1998
ACM
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
129
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....