An O(mn) algorithm for the anti-cent-dian problem.
Marcos ColebrookJoaquin SiciliaPublished in: Appl. Math. Comput. (2006)
Keyphrases
- experimental evaluation
- times faster
- search space
- single pass
- dynamic programming
- preprocessing
- np hard
- linear programming
- optimization algorithm
- computational complexity
- search algorithm
- probabilistic model
- matching algorithm
- high accuracy
- estimation algorithm
- improved algorithm
- input data
- classification algorithm
- k means
- worst case
- similarity measure
- maximum likelihood
- space complexity
- significant improvement
- recognition algorithm
- convergence rate
- computational cost
- least squares
- experimental study
- clustering method
- detection algorithm
- feature extraction
- support vector machine svm
- computationally efficient
- expectation maximization