391 search results - page 20 / 79 » Constructive Equivalence Relations on Computable Probability... |
101
click to vote
DAGSTUHL
2006
15 years 22 days ago
2006
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
103
click to vote
KDD
2008
ACM
15 years 11 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
IEEEARES
2009
IEEE
14 years 9 months ago
2009
IEEE
We present an automatic analyzer for measuring information flow within software systems. In this paper, we quantify leakage in terms of information theory and incorporate this comp...
104
click to vote
STOC
2010
ACM
15 years 3 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...