Improved Sublinear Time Algorithm for Longest Increasing Subsequence.
Michael MitzenmacherSaeed SeddighinPublished in: SODA (2021)
Keyphrases
- improved algorithm
- experimental evaluation
- learning algorithm
- detection algorithm
- cost function
- dynamic programming
- k means
- matching algorithm
- neural network
- binary search trees
- optimization algorithm
- input data
- linear programming
- computational cost
- significant improvement
- preprocessing
- computational complexity
- optimal solution
- similarity measure
- probabilistic model
- worst case
- high accuracy
- simulated annealing
- computationally efficient
- theoretical analysis
- segmentation algorithm
- reinforcement learning
- selection algorithm
- data sets