1095 search results - page 37 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
101
Voted
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
We present a new parallel repartitioning algorithm for adaptive finite-element meshes that significantly reduces the amount of data that needs to move between processors in orde...
116
click to vote
EUROPAR
2005
Springer
15 years 7 months ago
2005
Springer
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
129
click to vote
HIPC
2003
Springer
15 years 7 months ago
2003
Springer
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
110
click to vote
EDCC
2008
Springer
15 years 4 months ago
2008
Springer
Under the hypothesis of single failures in the network, some backup paths cannot be active at the same time because they protect against the failure of different components. Hence...