970 search results - page 53 / 194 » On encodings of spanning trees |
SIGMOD
2005
ACM
14 years 9 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
14 years 2 months ago
2004
Springer
CPM
2006
Springer
14 years 15 days ago
2006
Springer
COLING
2008
13 years 10 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
13 years 8 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...