A Simple and Fast Algorithm for Computing the N-th Term of a Linearly Recurrent Sequence.
Alin BostanRyuhei MoriPublished in: CoRR (2020)
Keyphrases
- experimental evaluation
- high accuracy
- worst case
- dynamic programming
- theoretical analysis
- times faster
- optimization algorithm
- learning algorithm
- input data
- improved algorithm
- matching algorithm
- detection algorithm
- computational cost
- significant improvement
- linear programming
- expectation maximization
- computationally efficient
- np hard
- segmentation algorithm
- cost function
- search space
- path planning
- preprocessing
- feed forward
- selection algorithm
- feature selection