A (1+e)-Approximation Algorithm for Sorting by Short Block-Moves.
Haitao JiangDaming ZhuPublished in: CSO (1) (2009)
Keyphrases
- experimental evaluation
- learning algorithm
- monte carlo
- optimal solution
- computational complexity
- significant improvement
- matching algorithm
- expectation maximization
- objective function
- sorting algorithms
- approximation ratio
- recognition algorithm
- detection algorithm
- high accuracy
- preprocessing
- image compression
- computationally efficient
- segmentation algorithm
- dynamic programming
- worst case
- error bounds
- k means
- improved algorithm
- cost function
- evolutionary algorithm
- piecewise constant
- fixed size
- block matching
- times faster
- computational cost
- optimization algorithm
- probabilistic model
- linear programming