A sublinear-time randomized approximation algorithm for matrix games.
Michael D. GrigoriadisLeonid G. KhachiyanPublished in: Oper. Res. Lett. (1995)
Keyphrases
- learning algorithm
- k means
- np hard
- dynamic programming
- preprocessing
- computational cost
- worst case
- randomized approximation
- optimal solution
- times faster
- experimental evaluation
- linear programming
- convergence rate
- detection algorithm
- optimization algorithm
- theoretical analysis
- probabilistic model
- significant improvement
- search space
- objective function
- input data
- segmentation algorithm
- monte carlo
- matching algorithm
- game theory
- video games
- recognition algorithm
- similarity matrix
- similarity measure