1095 search results - page 59 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
127
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
148
click to vote
ISPAN
2005
IEEE
15 years 8 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
110
click to vote
PVLDB
2010
15 years 24 days ago
2010
This paper describes a high performance sampling architecture for inference of latent topic models on a cluster of workstations. Our system is faster than previous work by over an...
130
Voted
ICDCS
2007
IEEE
15 years 6 months ago
2007
IEEE
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amo...
110
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...