An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays.
Alfredo García OlaverriPedro JodráJavier TejelPublished in: Inf. Process. Lett. (1998)
Keyphrases
- experimental evaluation
- learning algorithm
- cost function
- detection algorithm
- preprocessing
- computational cost
- highly efficient
- computational complexity
- np hard
- path planning
- matching algorithm
- simulated annealing
- computationally efficient
- string matching
- data sets
- combinatorial optimization
- high accuracy
- worst case
- dynamic programming
- optimal solution
- similarity measure
- clustering method
- classification algorithm
- search space
- convergence rate
- primal dual
- optimal path