218 search results - page 2 / 44 » Finite Trees as Ordinals |
WOLLIC
2007
Springer
13 years 11 months ago
2007
Springer
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
CIE
2006
Springer
13 years 9 months ago
2006
Springer
We introduce two hierarchies of unknown ordinal height. The hierarchies are induced by natural fragments of a calculus based on finite types and G
ICMLA
2010
13 years 3 months ago
2010
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
ALGORITHMICA
2005
13 years 5 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...