4095 search results - page 27 / 819 » How to test a tree |
NAACL
2010
13 years 5 months ago
2010
Recent work has proposed the use of an extracted tree grammar as the basis for treebank analysis and search queries, in which queries are stated over the elementary trees, which a...
COMPSAC
2006
IEEE
13 years 11 months ago
2006
IEEE
We propose Tree Hash to reduce bucket overflow, which is one of the inherent problems in dynamic hash techniques. In this investigation, we dicuss how to improve efficien cy of Tre...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
JMLR
2010
13 years 6 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...