827 search results - page 21 / 166 » The Complexity of Probabilistic Lobbying |
120
click to vote
STOC
1993
ACM
15 years 5 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
206
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
125
Voted
COCO
2001
Springer
15 years 6 months ago
2001
Springer
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
220
click to vote
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
Modeling objects by probability density functions (pdf) is a new powerful method to represent complex objects in databases. By representing an object as a pdf, e.g. a Gaussian, it...
96
Voted
UAI
1998
15 years 3 months ago
1998
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...