2084 search results - page 177 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
125
Voted
WDAG
2000
Springer
15 years 8 months ago
2000
Springer
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
131
Voted
WADS
2005
Springer
15 years 10 months ago
2005
Springer
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...
132
click to vote
ESA
2000
Springer
15 years 8 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
155
click to vote
TSP
2008
15 years 5 months ago
2008
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
156
Voted
ICRA
2006
IEEE
15 years 11 months ago
2006
IEEE
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...