A New Algorithm for Finding Trees with Many Leaves.
Joachim KneisAlexander LangerPeter RossmanithPublished in: Algorithmica (2011)
Keyphrases
- np hard
- learning algorithm
- path planning
- selection algorithm
- probabilistic model
- computational cost
- optimal solution
- matching algorithm
- detection algorithm
- optimization algorithm
- particle swarm optimization
- experimental evaluation
- dynamic programming
- significant improvement
- k means
- worst case
- estimation algorithm
- cost function
- segmentation algorithm
- preprocessing
- computational complexity
- convergence rate
- improved algorithm
- tree edit distance
- recognition algorithm
- times faster
- clustering method
- input data
- high accuracy
- motion estimation