1095 search results - page 13 / 219 » A Parallel Algorithm for Computing Betweenness Centrality |
HPDC
2002
IEEE
14 years 10 days ago
2002
IEEE
Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in ...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper presents a comparative study of robust diffusion algorithms when used for smoothing structural fields applied in volumetric image interpolation. The input data consists...
ADCM
2007
13 years 7 months ago
2007
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...
STRINGOLOGY
2004
13 years 8 months ago
2004
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...