562 search results - page 27 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
WSCG
2004
14 years 11 months ago
2004
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
NIPS
2003
14 years 11 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
TOG
1998
14 years 9 months ago
1998
This paper presents the Voronoi-clip, or V-clip, collision detection algorithm for polyhedral objects specified by a boundary representation. V-clip tracks the closest pair of fe...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
98
Voted
IAT
2009
IEEE
15 years 4 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....