96 search results - page 12 / 20 » Restructuring ordered binary trees |
156
Voted
ADC
2005
Springer
15 years 11 months ago
2005
Springer
With the advent of XML and its use as a database language, dependency and normal form theory has attracted novel research interest. Several approaches to build up a dependency and...
190
click to vote
DATAMINE
1999
15 years 5 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
177
click to vote
JAPLL
2006
15 years 5 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
149
Voted
DCG
2002
2002
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
15 years 5 months ago
The volume of the n-dimensional polytope nx := fy 2 Rn : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := x1; : : : ; xn with xi 0 for all i de nes a polyn...
149
click to vote
COCO
2009
Springer
15 years 9 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...