1095 search results - page 110 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
118
Voted
ICDCS
1995
IEEE
15 years 6 months ago
1995
IEEE
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
124
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
129
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, we propose an acceleration technique of the adaptive filtering scheme called adaptive proximal forward-backward splitting method. For accelerating the convergence ...
117
Voted
SC
2005
ACM
15 years 8 months ago
2005
ACM
The last decade has witnessed a rapid proliferation of superscalar cache-based microprocessors to build high-end computing (HEC) platforms, primarily because of their generality, ...
112
Voted
SPAA
2003
ACM
15 years 8 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...