A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem.
Anadi AgrawalPawel GawrychowskiPublished in: CoRR (2020)
Keyphrases
- learning algorithm
- computational complexity
- detection algorithm
- preprocessing
- experimental evaluation
- path planning
- selection algorithm
- probabilistic model
- dynamic programming
- significant improvement
- np hard
- cost function
- memory efficient
- high accuracy
- computationally efficient
- estimation algorithm
- objective function
- feature selection
- pattern matching
- space efficient
- times faster
- optimization algorithm
- theoretical analysis
- worst case
- k means