68 search results - page 5 / 14 » Extension of First-Order Theories into Trees |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
74
Voted
ICPR
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we investigate the possibilities offered by the extension of the connected component trees (cc-trees) to multivariate images. We propose a general framework for ima...
59
Voted
NAACL
2004
14 years 11 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...
FUIN
2010
14 years 6 months ago
2010
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...