Typically, decision tree construction algorithms apply a single \goodness of split" criterion to form each test node of the tree. It is a hypothesis of this research that better results can be obtained if during tree construction one applies a split criterion suited to the \location" of the test node in the tree. Speciically, given the objective of maximizing predictive accuracy, test nodes nea...

In this paper, we study the traces of Orlicz-Sobolev spaces on a regular rooted tree. After giving dyadic decomposition boundary tree, present characterization trace those first order whose Young function is form t p log ? ? ( e + ) , based integral averages elements decomposition.

This paper introduces a direction-sensitive and locally reorientable compact binary tree, called the Z tree, for representing digital images. A rotation operation is de ned on a subset of its node, called square nodes, to spatially reorganize the four grand children of any given square-node. The goal is to adapt the Z tree in order to produce a minimal cutset representation of homogeneous regio...

A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the values allowed for the other variable form a subtree of the constructed tree. It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consis...

The image that best expresses Darwin's thinking is the tree of life. However, Darwin's human evolutionary tree lacked almost everything because only the Neanderthals were known at the time and they were considered one extreme expression of our own species. Darwin believed that the root of the human tree was very deep and in Africa. It was not until 1962 that the root was shown to be much more r...

The uniform first-order theory of ground tree rewrite graphs is the set of all pairs consisting of a ground tree rewrite system and a first-order sentence that holds in the graph defined by the ground tree rewrite system. We prove that the complexity of the uniform first-order theory of ground tree rewrite graphs is in ATIME(2 poly(n) , O(n)). Providing a matching lower bound, we show that ther...

Attributed tree transducers are abstract models used to study properties of attribute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that arbitrary trees over a ranked alphabet are taken as input, instead of derivation trees of a context-free grammar. In this paper we show that with respect to the generating power this is not an abstrac...

Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize Lévy-Longo tree equivalence and Boehm tree equivalence. It has been adapted to a range of untyped, higher-order calculi, but types have presented a difficulty. In this paper, we present an account of normal form bisimulation for types, including recursive types. We develop our theory for a...

We prove that the complexity of the uniform first-order theory of ground tree rewrite graphs is in ATIME(22 poly(n) , O(n)). Providing a matching lower bound, we show that there is a fixed ground tree rewrite graph whose first-order theory is hard for ATIME(22 poly(n) , poly(n)) with respect to logspace reductions. Finally, we prove that there is a fixed ground tree rewrite graph together with ...