685 search results - page 32 / 137 » Succinct Trees in Practice |
105
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We evaluate the practical performance of labeling schemes for lowest common ancestors in trees. We develop different variants for encoding the labels. We then perform a thorough e...
104
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
134
Voted
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
108
Voted
IPL
2010
15 years 2 months ago
2010
A tree-like substructure on a computer chip whose task it is to carry a signal from a source circuit to possibly many sink circuits and which consists only of wires and so-called ...
119
Voted
ACL
1996
15 years 5 months ago
1996
In transformation-based parsing, a finite sequence of tree rewriting rules are checked for application to an input structure. Since in practice only a small percentage of rules ar...