Sciweavers

86 search results - page 11 / 18
» Equivalence of Labeled Markov Chains
Sort
View
CAI
2007
Springer
14 years 1 months ago
The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
Sotiris E. Nikoletseas, Christoforos Raptopoulos, ...
CONCUR
2003
Springer
14 years 25 days ago
Comparative Branching-Time Semantics
d Abstract) Christel Baier1 , Holger Hermanns2,3 , Joost-Pieter Katoen2 , and Verena Wolf1 1 Institut f¨ur Informatik I, University of Bonn R¨omerstraße 164, D-53117 Bonn, Germa...
Christel Baier, Holger Hermanns, Joost-Pieter Kato...
CSFW
2003
IEEE
14 years 27 days ago
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
Geoffrey Smith
LANC
2009
ACM
178views Education» more  LANC 2009»
14 years 8 days ago
A connection level model for IEEE 802.11 cells
We study a wireless network under the 802.11 random access protocol, supporting multiple physical layer rates. Based on models for the effective packet rates achieved at the MAC ...
Andrés Ferragut, Fernando Paganini
IJCAI
2001
13 years 9 months ago
Approximate inference for first-order probabilistic languages
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
Hanna Pasula, Stuart J. Russell