970 search results - page 53 / 194 » On encodings of spanning trees |
146
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
CPM
2006
Springer
15 years 1 months ago
2006
Springer
109
click to vote
COLING
2008
14 years 11 months ago
2008
This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the node...
IPL
2007
14 years 9 months ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...