218 search results - page 16 / 44 » Finite Trees as Ordinals |
113
click to vote
JCT
2006
14 years 11 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
EACL
2003
ACL Anthology
15 years 1 months ago
2003
ACL Anthology
Finite structure query (fsq for short) is a tool for querying syntactically annotated corpora. fsq employs a query language of high expressive power, namely full first order logi...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
ESA
1999
Springer
15 years 4 months ago
1999
Springer
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...