241 search results - page 19 / 49 » Learning Classes of Probabilistic Automata |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
ACL
2012
11 years 9 months ago
2012
Many semantic parsing models use tree transformations to map between natural language and meaning representation. However, while tree transformations are central to several state-...
IJAR
2010
13 years 5 months ago
2010
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
IANDC
2007
13 years 7 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper develops a weakly supervised algorithm that learns to segment rigid multi-colored objects from a set of training images and key points. The approach uses congealing to ...