364 search results - page 52 / 73 » Computing Communities in Large Networks Using Random Walks |
166
click to vote
ADHOC
2006
15 years 5 months ago
2006
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
156
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, ...
178
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
148
Voted
DSN
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
156
click to vote
ICNP
2006
IEEE
15 years 11 months ago
2006
IEEE
— File distribution via network coding has received a lot of attention lately. However, direct application of network coding may have security problems. In particular, attackers ...