179 search results - page 7 / 36 » An Optimal Decomposition Algorithm for Tree Edit Distance |
CIAC
2010
Springer
15 years 25 days ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
CP
2009
Springer
15 years 4 months ago
2009
Springer
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
JCB
2007
14 years 9 months ago
2007
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical consider...
ECAI
2000
Springer
15 years 1 months ago
2000
Springer
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
IPPS
2000
IEEE
15 years 1 months ago
2000
IEEE
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-inse...