423 search results - page 80 / 85 » Topology for Distributed Inference on Graphs |
138
Voted
STOC
2004
ACM
15 years 9 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
147
Voted
ACSAC
2010
IEEE
14 years 7 months ago
2010
IEEE
In this work we show that once a single peer-to-peer (P2P) bot is detected in a network, it may be possible to efficiently identify other members of the same botnet in the same ne...
168
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
151
click to vote
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
112
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...