Sciweavers

785 search results - page 11 / 157
» Binary Join Trees
Sort
View
NETWORKS
2002
14 years 9 months ago
Lazy evaluation in penniless propagation over join trees
Andrés Cano, Serafín Moral, Antonio ...
ISCIS
2009
Springer
15 years 2 months ago
Calculating the VC-dimension of decision trees
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...
Ozlem Asian, Olcay Taner Yildiz, Ethem Alpaydin
HPCC
2007
Springer
15 years 3 months ago
Parallel Database Sort and Join Operations Revisited on Grids
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
Werner Mach, Erich Schikuta
SIGCSE
1996
ACM
136views Education» more  SIGCSE 1996»
15 years 1 months ago
Thinking about binary trees in an object-oriented world
The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using c...
A. Michael Berman, Robert C. Duvall
70
Voted
IPL
2007
100views more  IPL 2007»
14 years 9 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
Brendan Lucier, Tao Jiang, Ming Li