A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents.
Nathan LinialAlex SamorodnitskyAvi WigdersonPublished in: STOC (1998)
Keyphrases
- strongly polynomial
- learning algorithm
- computational complexity
- dynamic programming
- cost function
- np hard
- segmentation algorithm
- objective function
- detection algorithm
- neural network
- clustering algorithm
- convex hull
- computational efficiency
- optimization algorithm
- worst case
- k means
- lower bound
- optimal solution
- similarity measure