Retrieval techniques based on pure similarity metrics are often suffered from the scales of image features. An alternative approach is to learn a mapping based on queries and rele...
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
This paper presents two Markov chain Monte Carlo (MCMC) algorithms for Bayesian inference of probabilistic context free grammars (PCFGs) from terminal strings, providing an altern...
Mark Johnson, Thomas L. Griffiths, Sharon Goldwate...
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...
Verena Wolf, Christel Baier, Mila E. Majster-Ceder...
Markovian testing and trace equivalences have been recently proposed as reasonable alternatives to Markovian bisimilarity, as both of them induce at the Markov chain level an aggr...