A Simple and General Problem and its Optimal Randomized Online Algorithm Design with Competitive Analysis.
Ying ZhangPublished in: CoRR (2015)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- times faster
- np hard
- learning algorithm
- provably correct
- improved algorithm
- k means
- competitive ratio
- online algorithms
- matching algorithm
- detection algorithm
- theoretical analysis
- computational cost
- experimental evaluation
- search space
- high accuracy
- recognition algorithm
- preprocessing
- probabilistic model
- locally optimal
- special case
- globally optimal
- exhaustive search
- objective function
- expectation maximization
- computational complexity
- data analysis
- optimization algorithm
- segmentation algorithm
- similarity measure
- computationally efficient
- space complexity
- optimal strategy
- optimal parameters
- optimal path
- particle swarm optimization
- linear programming
- minimum length
- randomized algorithms
- real time