Sorting can exponentially speed up pure dynamic programming.
Stasys JuknaHannes SeiwertPublished in: Inf. Process. Lett. (2020)
Keyphrases
- dynamic programming
- dp matching
- optimal control
- stereo matching
- sorting algorithms
- greedy algorithm
- reinforcement learning
- linear programming
- dynamic programming algorithms
- search space
- special case
- coarse to fine
- markov decision processes
- optimal policy
- object detection
- data sets
- expert systems
- three dimensional
- decision trees
- website
- image processing
- search engine
- learning algorithm
- information retrieval
- machine learning
- neural network