156 search results - page 4 / 32 » Decomposing Coverings and the Planar Sensor Cover Problem |
117
click to vote
SIAMCOMP
1998
15 years 1 days ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
110
Voted
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
121
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
106
Voted
WOWMOM
2009
ACM
15 years 6 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
116
click to vote
DCOSS
2010
Springer
15 years 17 days ago
2010
Springer
Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides ...