A Polynomial-Time Algorithm to Approximate the Mixed Volume within a Simply Exponential Factor.
Leonid GurvitsPublished in: Discret. Comput. Geom. (2009)
Keyphrases
- computational complexity
- experimental evaluation
- learning algorithm
- np hard
- preprocessing
- worst case
- objective function
- significant improvement
- special case
- cost function
- dynamic programming
- optimization algorithm
- k means
- improved algorithm
- recognition algorithm
- piecewise linear
- computationally efficient
- theoretical analysis
- detection algorithm
- times faster
- matching algorithm
- strongly polynomial
- classification algorithm
- probabilistic model
- search space
- optimal solution
- image segmentation