558 search results - page 2 / 112 » Trees and Matchings |
SODA
1997
ACM
13 years 6 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...
FSTTCS
2005
Springer
13 years 10 months 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...
ML
2008
ACM
13 years 5 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...
AAAI
2006
13 years 6 months ago
2006
This paper is concerned with the problem of structured data extraction from Web pages. The objective of the research is to automatically segment data records in a page, extract da...
JCAMD
1998
13 years 5 months ago
1998
