575 search results - page 4 / 115 » Computing Maximum Subsequence in Parallel |
WG
2009
Springer
15 years 2 months ago
2009
Springer
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
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,...
74
Voted
ICPP
1987
IEEE
15 years 1 months ago
1987
IEEE
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 ...
HPCC
2005
Springer
15 years 3 months ago
2005
Springer
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
We introduce a parallelization of the maximumlikelihood cosine transform. This transform consists of a computationally intensive iterative fitting process, but is readily decompo...