An O(log n) Algorithm for Computing General Order-k Fibonacci Numbers.
Thomas C. WilsonJoseph ShorttPublished in: Inf. Process. Lett. (1980)
Keyphrases
- optimization algorithm
- linear programming
- dynamic programming
- worst case
- times faster
- theoretical analysis
- single pass
- clustering method
- optimal solution
- cost function
- experimental evaluation
- computational cost
- improved algorithm
- learning algorithm
- simulated annealing
- estimation algorithm
- probabilistic model
- np hard
- special case
- preprocessing
- computational complexity
- convergence rate
- log log
- matching algorithm
- ant colony optimization
- experimental study
- detection algorithm
- maximum likelihood
- high accuracy
- state space
- hidden markov models
- face recognition