5699 search results - page 71 / 1140 » Alternating model trees |
146
Voted
NAACL
2004
15 years 8 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...
182
click to vote
LATA
2009
Springer
16 years 1 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...
187
click to vote
LFCS
2007
Springer
16 years 25 days 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...
161
click to vote
WABI
2004
Springer
16 years 1 days 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...
177
click to vote
EOR
2006
15 years 6 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...