336 search results - page 8 / 68 » Effective Randomness for Computable Probability Measures |
77
Voted
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
AML
2008
14 years 9 months ago
2008
We investigate notions of randomness in the space C(2N ) of continuous functions on 2N . A probability measure is given and a version of the Martin-L
73
Voted
JMLR
2010
14 years 4 months ago
2010
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
IFM
2010
Springer
2010
Springer
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
14 years 8 months ago
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...