827 search results - page 87 / 166 » The Complexity of Probabilistic Lobbying |
149
click to vote
AUSAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The interpretation of complex discourse, such as arguments, is a difficult task that often requires validation, i.e., a system may need to present its interpretation of ...
152
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
159
click to vote
NGITS
1995
Springer
15 years 10 months ago
1995
Springer
This paper investigates the problem ofautomatically learning declarative models of information sources available on the Internet. We report on ILA, a domain-independent program th...
171
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
139
click to vote
UAI
1997
15 years 7 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...