564 search results - page 4 / 113 » Error-tolerant Tree Matching |
ML
2008
ACM
13 years 7 months ago
2008
ACM
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
FSTTCS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges...
SODA
1997
ACM
13 years 8 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
ICCV
1999
IEEE
14 years 9 months ago
1999
IEEE
COMBINATORICS
2000
13 years 7 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...