An Optimal Algorithm for Expanding the Composition of Polynomials.
Wayne LiuStephen MannPublished in: ACM Trans. Graph. (1997)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- computational complexity
- learning algorithm
- cost function
- preprocessing
- globally optimal
- computational cost
- improved algorithm
- expectation maximization
- experimental evaluation
- times faster
- path planning
- space complexity
- input data
- simulated annealing
- np hard
- significant improvement
- k means
- recognition algorithm
- locally optimal
- closed form
- optimization algorithm
- particle swarm optimization
- linear programming
- high accuracy
- probabilistic model
- search space
- objective function
- similarity measure