656 search results - page 13 / 132 » Marrying Words and Trees |
LATA
2009
Springer
15 years 4 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...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study tree languages that can be defined in 2. These are tree languages definable by a first-order formula whose quantifier prefix is , and simultaneously by a first-order for...
81
Voted
ACL
2007
14 years 11 months ago
2007
We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
AI
2008
Springer
14 years 9 months ago
2008
Springer
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...