1095 search results - page 47 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
137
Voted
ECCC
2011
14 years 9 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
118
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. ...
HPDC
2002
IEEE
15 years 7 months ago
2002
IEEE
Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These syste...
114
click to vote
ICPP
1998
IEEE
15 years 6 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
103
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...