1095 search results - page 73 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
STACS
1999
Springer
15 years 6 months ago
1999
Springer
We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsou...
113
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our su...
96
Voted
CCGRID
2003
IEEE
15 years 7 months ago
2003
IEEE
Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for Internet-scale information retrieval and search systems because they require neither...
169
Voted
DIALM
2007
ACM
15 years 6 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
116
click to vote
HPDC
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...