Browsing Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering by Subject "A-priori probabilities"
Now showing items 1-6 of 6
-
Conference Object
Bound on the probability of HMM misclassification
(2011)In this paper we consider the problem of classifying a sequence of observations among two known hidden Markov models (HMMs). We use a classifier that minimizes the probability of error (i.e., the probability of misclassification), ...
-
Conference Object
Bounds on the probability of misclassification among hidden Markov models
(2011)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 ...
-
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 ...
-
Conference Object
Initial state opacity in stochastic des
(2013)A non-deterministic finite automaton is initial-state opaque if the membership of its true initial state to a given set of secret states S remains opaque (i.e., uncertain) to an intruder who observes system activity through ...
-
Conference Object
Probabilistic marking estimation in labeled petri nets
(Institute of Electrical and Electronics Engineers Inc., 2013)Given a labeled Petri net, possibly with silent transitions, we are interested in performing current marking estimation in a probabilistic setting. We assume a known initial marking or a known finite set of initial markings, ...
-
Article
Probabilistic marking estimation in labeled petri nets
(2015)Given a labeled Petri net, possibly with silent (unobservable) transitions, we are interested in performing marking estimation in a probabilistic setting. We assume a known initial marking or a known finite set of initial ...