We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne,...
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
We introduce a parallelization of the maximumlikelihood cosine transform. This transform consists of a computationally intensive iterative fitting process, but is readily decompo...
Hoda El-Sayed, Marc Salit, John Travis, Judith Ell...