Results 1  10
of
196,495
The infinite tree
 In Association for Computational Linguistics (ACL
, 2007
"... Historically, unsupervised learning techniques have lacked a principled technique for selecting the number of unseen components. Research into nonparametric priors, such as the Dirichlet process, has enabled instead the use of infinite models, in which the number of hidden categories is not fixed, ..."
Abstract

Cited by 44 (0 self)
 Add to MetaCart
, but can grow with the amount of training data. Here we develop the infinite tree, a new infinite model capable of representing recursive branching structure over an arbitrarily large set of hidden categories. Specifically, we develop three infinite tree models, each of which enforces different
Unification of Kinded Infinite Trees
"... We study the problem of unifying infinite trees with variables subject to constraints on the trees they may be substituted for. The constraints are given by mappings from variables to trees, called kindings. In particular, we show that if a set of equations over a given kinding is unifiable, it has ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the problem of unifying infinite trees with variables subject to constraints on the trees they may be substituted for. The constraints are given by mappings from variables to trees, called kindings. In particular, we show that if a set of equations over a given kinding is unifiable, it has
Infinite Trees and the Future
 In Proc. 7th Intern. Symp. on Graph Drawing, volume 1731 of LNCS
, 1999
"... We study the problem of designing layout facilities for the navigation of an "infinite" graph, i.e. a graph that is so large that its visualization is unfeasible, even by gluing together all the screen snapshots that a user can take during the navigation. We propose a framework for designi ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
for designing layout facilities that support the navigation of an infinite tree. The framework allows to exploit the knowledge of future moves of the user in order to reduce the changes in her mental map during the navigation. Variants of the classical ReingoldTilford algorithm are presented
Distributing labels on infinite trees
, 809
"... Sturmian words are infinite binary words with many equivalent definitions: They have a minimal factor complexity among all aperiodic sequences; they are balanced sequences (the labels 0 and 1 are as evenly distributed as possible) and they can be constructed using a mechanical definition. All this p ..."
Abstract
 Add to MetaCart
this properties make them good candidates for being extremal points in scheduling problems over two processors. In this paper, we consider the problem of generalizing Sturmian words to trees. The problem is to evenly distribute labels 0 and 1 over infinite trees. We show that (strongly) balanced trees exist
Graceful Tree Conjecture for Infinite Trees
"... One of the most famous open problems in graph theory is the Graceful Tree Conjecture, which states that every finite tree has a graceful labeling. In this paper, we define graceful labelings for countably infinite graphs, and state and verify a Graceful Tree Conjecture for countably infinite trees. ..."
Abstract
 Add to MetaCart
One of the most famous open problems in graph theory is the Graceful Tree Conjecture, which states that every finite tree has a graceful labeling. In this paper, we define graceful labelings for countably infinite graphs, and state and verify a Graceful Tree Conjecture for countably infinite trees
EXCLUDING INFINITE TREES
, 1993
"... For each infinite cardinal k we give several necessary and sufficient conditions for a graph not to contain a minor isomorphic to the infinite kbranching tree in terms of a certain kind of a "treedecomposition," in terms of a "pathdecomposition," and also in terms of a "c ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
For each infinite cardinal k we give several necessary and sufficient conditions for a graph not to contain a minor isomorphic to the infinite kbranching tree in terms of a certain kind of a "treedecomposition," in terms of a "pathdecomposition," and also in terms of a "
Colorings of the DRegular Infinite Tree
, 2002
"... The existence of small dregular graphs of a prescribed girth g is equivalent to the existence of certain codes in the dregular infinite tree. We show that in the tree "perfect" codes exist, but those are usually not "graphic". We also give an explicit coloring that is "nea ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The existence of small dregular graphs of a prescribed girth g is equivalent to the existence of certain codes in the dregular infinite tree. We show that in the tree "perfect" codes exist, but those are usually not "graphic". We also give an explicit coloring that is "
Infinite Trees and the Future ⋆ Extended Abstract
"... Abstract. We study the problem of designing layout facilities for the navigation of an “infinite ” graph, i.e. a graph that is so large that its visualization is unfeasible, even by gluing together all the screen snapshots that a user can take during the navigation. We propose a framework for design ..."
Abstract
 Add to MetaCart
for designing layout facilities that support the navigation of an infinite tree. The framework allows to exploit the knowledge of future moves of the user in order to reduce the changes in her mental map during the navigation. Variants of the classical ReingoldTilford algorithm are presented
Theory of Finite or Infinite Trees Revisited
 UNDER CONSIDERATION FOR PUBLICATION IN THEORY AND PRACTICE OF LOGIC PROGRAMMING
, 2007
"... We present in this paper a firstorder axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation finite(t) which enables to distinguish between finite or infinite trees. We show that T has at least one model ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present in this paper a firstorder axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation finite(t) which enables to distinguish between finite or infinite trees. We show that T has at least one
Results 1  10
of
196,495