1095 search results - page 22 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...
TCS
2008
13 years 7 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
The nested data-parallel programming model supports the design and implementation of irregular parallel algorithms. This paper describes work in progress to incorporate nested data...