86 search results - page 8 / 18 » Equivalence of Labeled Markov Chains |
PE
2011
Springer
13 years 2 months ago
2011
Springer
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
ENTCS
2008
13 years 7 months ago
2008
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
This paper breaks with the common practice of using a joint state space representation and performing the joint data association in multi-object tracking. Instead, we present an i...
ACL
2009
13 years 5 months ago
2009
We would like to draw attention to Hidden Markov Tree Models (HMTM), which are to our knowledge still unexploited in the field of Computational Linguistics, in spite of highly suc...
NIPS
2004
13 years 9 months ago
2004
We describe semi-Markov conditional random fields (semi-CRFs), a conditionally trained version of semi-Markov chains. Intuitively, a semiCRF on an input sequence x outputs a "...