An algorithm for solving the longest increasing circular subsequence problem.
Sebastian DeorowiczPublished in: Inf. Process. Lett. (2009)
Keyphrases
- dynamic programming
- learning algorithm
- optimal solution
- cost function
- objective function
- improved algorithm
- matching algorithm
- computationally efficient
- computational cost
- experimental evaluation
- np hard
- significant improvement
- probabilistic model
- high accuracy
- input data
- optimization algorithm
- classification algorithm
- preprocessing
- k means
- upper bound
- particle swarm optimization
- evolutionary algorithm
- theoretical analysis
- tree structure
- recognition algorithm
- video sequences