A branch-and-bound algorithm with multiple bound types computes the most probable marginal path in triplet Markov models much faster than exhaustive search, with m-Viterbi giving the best lower bounds.
In: Advanced Concepts for Intelligent Vision Systems (2004)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
stat.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Branch-and-bound method for calculating Viterbi path in triplet Markov models
A branch-and-bound algorithm with multiple bound types computes the most probable marginal path in triplet Markov models much faster than exhaustive search, with m-Viterbi giving the best lower bounds.