Browsing by Subject "Low computational complexity"
Now showing items 1-2 of 2
-
Conference Object
Convergence of belief propagation algorithms on binary pairwise Gibbs random fields
(2011)In this paper, we study the convergence of belief propagation algorithms (BPAs) on binary pairwise Gibbs random fields (BP-GRFs). Exploiting the equivalence of BPA on the graph associated with BP-GRF and the corresponding ...
-
Conference Object
Hidden markov model classification based on empirical frequencies of observed symbols
(IFAC Secretariat, 2014)Given a sequence of observations, classification among two known hidden Markov models (HMMs) can be accomplished with a classifier that minimizes the probability of error (i.e., the probability of misclassification) by ...