562 search results - page 9 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
MST
2006
13 years 7 months ago
2006
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...