A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume.
Leonid GurvitsAlex SamorodnitskyPublished in: STOC (2000)
Keyphrases
- computational complexity
- detection algorithm
- times faster
- cost function
- dynamic programming
- computational cost
- learning algorithm
- np hard
- experimental evaluation
- worst case
- optimization algorithm
- high accuracy
- expectation maximization
- theoretical analysis
- significant improvement
- matching algorithm
- objective function
- simulated annealing
- linear programming
- k means