830 search results - page 7 / 166 » Route kernels for trees |
ACL
2010
14 years 9 months ago
2010
We propose Bilingual Tree Kernels (BTKs) to capture the structural similarities across a pair of syntactic translational equivalences and apply BTKs to sub-tree alignment along wi...
185
click to vote
ALPIT
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper proposes a Unified Dynamic Relation Tree (DRT) span for tree kernel-based semantic relation extraction between entity names. The basic idea is to apply a variety of lin...
133
Voted
MOBISYS
2003
ACM
15 years 11 months ago
2003
ACM
This work explores several system issues regarding the design and implementation of routing protocols for ad-hoc wireless networks. We examine the routing architecture in current ...
125
click to vote
COLING
2008
15 years 1 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...
SODA
1997
ACM
15 years 1 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...