1591 search results - page 296 / 319 » Random lifts of graphs |
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. Th...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...