37 search results - page 3 / 8 » Restricted rotation distance between binary trees |
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
DGCI
2003
Springer
13 years 11 months ago
2003
Springer
In order to make image analysis methods more reliable it is important to analyse to what extend shape information is preserved during image digitization. Most existing approaches t...
ICB
2007
Springer
13 years 9 months ago
2007
Springer
LBP (Local Binary Pattern) as an image operator is used to extract LBPH (LBP histogram) features for texture description. In this paper, we present a novel method to use LBPH featu...
TIT
1998
13 years 5 months ago
1998
—A length n group code over a group G is a subgroup of Gn under component-wise group operation. Group codes over dihedral groups DM, with 2M elements, that are two-level construc...
CORR
1998
Springer
13 years 5 months ago
1998
Springer
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierar...