459 search results - page 72 / 92 » Computational Complexity of Probabilistic Disambiguation |
122
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
NDSS
2008
IEEE
15 years 6 months ago
2008
IEEE
In [22] we showed that existing single-server computational private information retrieval (PIR) protocols for the purpose of preserving client access patterns leakage are orders o...
155
click to vote
BMCBI
2005
14 years 11 months ago
2005
Background: Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership...
106
click to vote
STOC
2004
ACM
16 years 19 hour ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
105
click to vote
IJCAI
1997
15 years 1 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...