1095 search results - page 42 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
EUROPAR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper presents new techniques for master-slave tasking on treeshaped networks with fully heterogeneous communication and processing resources. A large number of inde...
114
click to vote
AAIM
2008
Springer
15 years 8 months ago
2008
Springer
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...
123
click to vote
WSC
2008
15 years 4 months ago
2008
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...
150
click to vote
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
134
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...