562 search results - page 11 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
DATE
2000
IEEE
13 years 11 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
SIGMETRICS
2004
ACM
14 years 24 days ago
2004
ACM
The problem of estimating the capacity of an Internet path is one of fundamental importance. Due to the multitude of potential applications, a large number of solutions have been ...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Correlation is a very effective way to align intensity images. We extend the correlation technique to point set registration using a method we call kernel correlation. Kernel corre...