238 search results - page 16 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
78
Voted
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
69
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
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...
CAIP
1999
Springer
15 years 1 months ago
1999
Springer
This paper casts the problem of point-set alignment via Procrustes analysis into a maximum likelihood framework using the EM algorithm. The aim is to improve the robustness of the...
CSB
2005
IEEE
15 years 3 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...