A Simple Algorithm for Computing the Smallest Enclosing Circle.
Sven SkyumPublished in: Inf. Process. Lett. (1991)
Keyphrases
- dynamic programming
- single pass
- worst case
- k means
- objective function
- selection algorithm
- theoretical analysis
- np hard
- experimental evaluation
- high accuracy
- estimation algorithm
- improved algorithm
- clustering method
- computational cost
- computational complexity
- probabilistic model
- similarity measure
- preprocessing
- recognition algorithm
- times faster
- path planning
- segmentation algorithm
- linear programming
- neural network
- search space
- significant improvement
- association rules
- computationally efficient
- lower bound
- experimental study
- matching algorithm
- expectation maximization
- simulated annealing
- feature space