1095 search results - page 107 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
137
Voted
PODC
2010
ACM
15 years 6 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
105
Voted
COLCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—Nodes within existing P2P networks typically exchange periodic keep-alive messages in order to maintain network connections between neighbours. This paper investigates a...
151
Voted
ISPDC
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
141
Voted
PODC
2003
ACM
15 years 8 months ago
2003
ACM
We investigate issues related to the probe complexity of quorum systems and their implementation in a dynamic environment. Our contribution is twofold. The first regards the algo...
106
Voted
ICPP
2005
IEEE
15 years 8 months ago
2005
IEEE
The Cosmic Microwave Background (CMB) is an exquisitely sensitive probe of the fundamental parameters of cosmology. Extracting this information is computationally intensive, requi...