61 search results - page 4 / 13 » A Distributed Algorithm for Computing Voronoi Diagram in the... |
DC
2010
13 years 7 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
TVCG
2008
13 years 7 months ago
2008
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
IPPS
2002
IEEE
14 years 13 days ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
We present an efficient algorithm to compute the coverage map of a given set of transmitters under interference constraints. That is, we compute the set of points that lie within ...