827 search results - page 17 / 166 » The Complexity of Probabilistic Lobbying |
150
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
175
click to vote
FOCS
1991
IEEE
15 years 9 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
146
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
234
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
156
click to vote
JMLR
2010
15 years 24 days ago
2010
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...