Index Terms
- Optimum split trees
Recommendations
Median split trees: a fast lookup technique for frequently occuring keys
Split trees are a new technique for searching sets of keys with highly skewed frequency distributions. A split tree is a binary search tree each node of which contains two key values—a node value which is a maximally frequent key in that subtree, and a ...
Optimum Communication Spanning Trees
Given a set of nodes $N_i (i = 1,2, \cdots ,n)$ which may represent cities and a set of requirements $r_{ij} $ which may represent the number of telephone calls between $N_i $ and $N_j $, the problem is to build a spanning tree connecting these n nodes ...
The JS-graphs of Join and Split Trees
SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometryLet f be a continuous function defined on a topological space. As we increase the function value, connected components in the level set of f appear, disappear, merge, or split, and the Reeb graph tracks these changes. The join and split trees of f track ...
Comments