745 search results - page 99 / 149 » On Generating Random Network Structures: Connected Graphs |
127
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
115
Voted
AUTOMATICA
2011
14 years 7 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
138
click to vote
MST
2010
14 years 7 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
121
click to vote
CORR
2010
Springer
15 years 20 days ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
99
Voted
PE
2006
Springer
15 years 15 days ago
2006
Springer
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...