A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of Trees.
Ronald I. BeckerStephen R. SchachPublished in: CAAP (1984)
Keyphrases
- preprocessing
- times faster
- computational cost
- objective function
- dynamic programming
- cost function
- tree structure
- computationally efficient
- experimental evaluation
- matching algorithm
- detection algorithm
- computational complexity
- similarity measure
- improved algorithm
- learning algorithm
- classification algorithm
- np hard
- high accuracy
- significant improvement
- recognition algorithm
- path planning
- probabilistic model
- prefix tree
- shortest path
- segmentation algorithm
- particle swarm optimization
- data sets
- k means
- decision trees
- neural network