1186 search results - page 169 / 238 » Improving Random Walk Performance |
TSP
2010
13 years 4 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
EDCC
2010
Springer
14 years 2 months ago
2010
Springer
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
CIKM
2008
Springer
13 years 12 months ago
2008
Springer
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
ALENEX
2010
13 years 11 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
OPODIS
2007
13 years 11 months ago
2007
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....