Sciweavers

18 search results - page 1 / 4
» On the Computation of the Relative Entropy of Probabilistic ...
Sort
View
IJFCS
2008
108views more  IJFCS 2008»
13 years 5 months ago
On the Computation of the Relative Entropy of Probabilistic Automata
Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Mic...
TCS
2008
13 years 5 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
CSFW
2007
IEEE
14 years 5 days ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini
TCS
2010
13 years 17 days ago
Weak bisimulation for Probabilistic Timed Automata
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
ICANN
2009
Springer
13 years 10 months ago
Computing with Probabilistic Cellular Automata
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
Martin Schüle, Thomas Ott, Ruedi Stoop