6393 search results - page 427 / 1279 » Randomized Algorithms on the Mesh |
221
click to vote
DFG
1992
Springer
15 years 11 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
168
click to vote
SPAA
1992
ACM
15 years 11 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
148
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We experimentally study the reliability of geometric software for point location in simple polygons. As expected, the code we tested works very well for random query points. Howeve...
170
click to vote
WSC
2001
15 years 8 months ago
2001
In this paper we present an algorithm for simulating functions of the minimum and terminal value for a random walk with Gaussian increments. These expectations arise in connection...
163
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...