| http://www.w3.org/ns/prov#value | - A simple technique based on a dynamic programming method for finding an optimal parse, or the best sequence of states, is the Viterbi algorithm, which requires o(N2D2L) calculations, where N is the number of states, D is the longest duration and L is the sequence length [11].
|
