Is the Euclidean algorithm optimal among its peers?
Lou van den DriesYiannis N. MoschovakisPublished in: Bull. Symb. Log. (2004)
Keyphrases
- dynamic programming
- optimal solution
- learning algorithm
- worst case
- np hard
- globally optimal
- experimental evaluation
- detection algorithm
- optimization algorithm
- high accuracy
- computational complexity
- locally optimal
- times faster
- theoretical analysis
- preprocessing
- computational cost
- objective function
- particle swarm optimization
- closed form
- linear programming
- expectation maximization
- piecewise linear
- cost function
- multi objective
- similarity measure
- weighting coefficients
- space complexity
- improved algorithm
- optimal parameters
- convergence rate
- path planning
- classification algorithm
- computationally efficient
- significant improvement
- k means
- search space
- image segmentation