1095 search results - page 67 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
153
click to vote
POPL
2011
ACM
14 years 5 months ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
119
click to vote
SPAA
1995
ACM
15 years 6 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
111
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoret...
129
Voted
ICDCS
2008
IEEE
15 years 9 months ago
2008
IEEE
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
115
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...