O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies.
Limin XiangKazuo UshijimaKai ChengJianjun ZhaoCunwei LuPublished in: PDCAT (2004)
Keyphrases
- experimental evaluation
- dynamic programming
- times faster
- search space
- optimization algorithm
- high accuracy
- cost function
- np hard
- learning algorithm
- objective function
- preprocessing
- binary search trees
- matching algorithm
- segmentation algorithm
- worst case
- k means
- computational complexity
- probabilistic model
- significant improvement
- optimization problems
- particle swarm optimization
- expectation maximization
- np complete
- lower bound
- clustering method
- similarity measure
- convergence rate
- neural network