597 search results - page 87 / 120 » Homomorphisms of random paths |
RSA
2010
14 years 10 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
109
click to vote
PERCOM
2006
ACM
15 years 11 months ago
2006
ACM
Typical packet traffic in a sensor network reveals pronouncedpatterns that allow an adversary analyzing packet traffic to deduce the location of a base station. Once discovered, t...
110
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
100
click to vote
INFOSCALE
2006
ACM
15 years 5 months ago
2006
ACM
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
105
click to vote
SIGMETRICS
2003
ACM
15 years 5 months ago
2003
ACM
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...