An Online Algorithm for the Dynamic Maximal Dense Tree Problem.
Baruch AwerbuchTripurari SinghPublished in: Algorithmica (2002)
Keyphrases
- learning algorithm
- tree structure
- optimization algorithm
- dynamic programming
- worst case
- preprocessing
- k means
- convex hull
- np hard
- image segmentation
- objective function
- linear programming
- detection algorithm
- pruning algorithm
- recognition algorithm
- experimental evaluation
- high accuracy
- simulated annealing
- input data
- similarity measure
- passive aggressive
- spanning tree
- suffix tree
- tree construction
- binary tree
- path planning
- dynamic environments
- computational cost
- cost function
- multi objective
- computational complexity
- decision trees