Skip to main content

Table 4 Running time comparison of Viterbi algorithm

From: A graph-based big data optimization approach using hidden Markov model and constraint satisfaction problem

Algorithm

Running time (s)

Original algorithm

CSP-Optimized algorithm

Viterbi

0,1

0,08