A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies.
Martin E. DyerAlan M. FriezeRavi KannanPublished in: J. ACM (1991)
Keyphrases
- computational complexity
- worst case
- dynamic programming
- theoretical analysis
- detection algorithm
- randomly generated
- learning algorithm
- segmentation algorithm
- np hard
- optimization algorithm
- search space
- preprocessing
- convergence rate
- neural network
- expectation maximization
- strongly polynomial
- simulated annealing
- computational cost
- experimental evaluation
- cost function
- objective function
- high accuracy
- particle swarm optimization
- probabilistic model
- multi objective
- k means
- optimal solution
- piecewise linear