A sweep-plane algorithm for generating random tuples in simple polytopes.
Josef LeydoldWolfgang HörmannPublished in: Math. Comput. (1998)
Keyphrases
- computational cost
- matching algorithm
- improved algorithm
- k means
- learning algorithm
- randomly generated
- significant improvement
- dynamic programming
- clustering method
- optimization algorithm
- worst case
- experimental evaluation
- search space
- geometric constraints
- preprocessing
- computational complexity
- objective function
- high accuracy
- convex hull
- computationally efficient
- times faster
- three dimensional
- detection algorithm
- database
- parametric curves
- recognition algorithm
- convergence rate
- minimum length
- segmentation algorithm
- expectation maximization
- simulated annealing
- probabilistic model
- np hard
- cost function
- query processing
- decision trees
- genetic algorithm