Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms.
Arturs BackursChristos TzamosPublished in: CoRR (2016)
Keyphrases
- orders of magnitude
- data structure
- database
- highly efficient
- recently developed
- significant improvement
- computationally efficient
- worst case
- learning algorithm
- theoretical analysis
- optimization problems
- computational cost
- np hard
- hidden markov models
- evolutionary algorithm
- computational efficiency
- computational complexity
- reinforcement learning
- hard problems