7913 search results - page 1199 / 1583 » Information Collection on a Graph |
198
click to vote
INFOCOM
2005
IEEE
16 years 13 days ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
187
click to vote
IPPS
2005
IEEE
16 years 13 days ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
167
click to vote
PADS
2005
ACM
16 years 12 days ago
2005
ACM
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
180
click to vote
PODC
2005
ACM
16 years 12 days ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
223
click to vote
FSTTCS
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...