4865 search results - page 350 / 973 » The Complexity of Graph Connectivity |
181
click to vote
TMC
2008
15 years 6 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
163
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
193
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
181
click to vote
ICRA
2006
IEEE
16 years 24 days ago
2006
IEEE
— When a network of robots or static sensors is emplaced in an environment, the spatial relationships between the sensing units must be inferred or computed for most key applicat...
151
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
A Steiner star for a set P of n points in Rd connects an arbitrary point in Rd to all points of P, while a star connects one of the points in P to the remaining n - 1 points of P....