338 search results - page 22 / 68 » Fast distributed random walks |
120
click to vote
STOC
1994
ACM
15 years 1 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
CN
2000
14 years 9 months ago
2000
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
76
Voted
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
75
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
104
click to vote
SAC
2010
ACM
15 years 4 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...