5699 search results - page 71 / 1140 » Alternating model trees |
108
click to vote
NAACL
2004
15 years 5 months ago
2004
Many probabilistic models for natural language are now written in terms of hierarchical tree structure. Tree-based modeling still lacks many of the standard tools taken for grante...
148
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
143
click to vote
LFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
116
click to vote
WABI
2004
Springer
15 years 9 months ago
2004
Springer
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
140
click to vote
EOR
2006
15 years 4 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...