785 search results - page 44 / 157 » Binary Join Trees |
COMBINATORICS
2006
14 years 9 months ago
2006
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
123
click to vote
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
IDEAL
2000
Springer
15 years 1 months ago
2000
Springer
Quantization of continuous variables is important in data analysis, especially for some model classes such as Bayesian networks and decision trees, which use discrete variables. Of...
FUIN
2010
14 years 7 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
JOIN
2007
14 years 9 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...