2093 search results - page 267 / 419 » Statistical Point Geometry |
128
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
133
click to vote
SIGMOD
1998
ACM
15 years 6 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
142
click to vote
SIGGRAPH
1996
ACM
15 years 6 months ago
1996
ACM
Creating freeform surfaces is a challenging task even with advanced geometric modeling systems. Laser range scanners offer a promising alternative for model acquisition--the 3D sc...
113
click to vote
SIGGRAPH
1993
ACM
15 years 6 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
183
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...