819 search results - page 27 / 164 » Parallelization with Tree Skeletons |
64
Voted
SPAA
1998
ACM
15 years 1 months ago
1998
ACM
CCECE
2006
IEEE
15 years 3 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
75
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 ...
ICPP
1993
IEEE
15 years 1 months ago
1993
IEEE
We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to min...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
