Sciweavers

916 search results - page 144 / 184
» Distributed Construction of a Fault-Tolerant Network from a ...
Sort
View
INFOCOM
2011
IEEE
14 years 10 months ago
Fine-grained location-free planarization in wireless sensor networks
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...
Dezun Dong, Yunhao Liu, Xiangke Liao, Xiang-Yang L...
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 11 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
APPML
2007
154views more  APPML 2007»
15 years 6 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio
ICPADS
2006
IEEE
16 years 6 days ago
Oriented Overlays For Clustering Client Requests To Data-Centric Network Services
Many of the data-centric network services deployed today hold massive volumes of data at their origin websites, and access the data to dynamically generate responses to user reque...
Congchun He, Vijay Karamcheti
WD
2010
15 years 4 months ago
Vicinity resource cartography for delay-tolerant networks: A holistic perspective
In this paper we propose a distributed approach to construct vicinity resource maps at each node in a delaytolerant network. The scheme uses recent encounters to estimate the avail...
Gabriel Sandulescu, Péter Schaffer, Simin N...