A Parallel Algorithm for Bound-Smoothing.

Kumar Rajan Narsingh Deo

Published in: IPPS/SPDP (1999)

Keyphrases

parallel algorithm
upper bound
parallel computation
lower bound
shared memory
cluster of workstations
worst case
parallel programming
discovery of association rules
medial axis transform
binary search trees
interconnection networks
parallel version
pc cluster
parallel implementations