Refinements of Miller's Algorithm over Weierstrass Curves Revisited.
Duc-Phong LeChao-Liang LiuPublished in: Comput. J. (2011)
Keyphrases
- preprocessing
- theoretical analysis
- computational cost
- dynamic programming
- experimental evaluation
- learning algorithm
- improved algorithm
- computational complexity
- recognition algorithm
- input data
- matching algorithm
- times faster
- np hard
- k means
- segmentation algorithm
- clustering method
- tree structure
- probabilistic model
- estimation algorithm
- similarity measure
- path planning
- polygonal approximation
- computationally efficient
- high accuracy
- scheduling problem
- cost function
- search space
- lower bound
- objective function