Sciweavers

12 search results - page 1 / 3
» Threshold values of random K-SAT from the cavity method
Sort
View
RSA
2006
62views more  RSA 2006»
13 years 7 months ago
Threshold values of random K-SAT from the cavity method
: Using the cavity equations of M
Stephan Mertens, Marc Mézard, Riccardo Zecc...
ICS
2010
Tsinghua U.
13 years 11 months ago
Bounds on the Quantum Satisfiability Threshold
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
Sergey Bravyi, Cristopher Moore, Alexander Russell
CVPR
2007
IEEE
14 years 9 months ago
Two thresholds are better than one
The concept of the Bayesian optimal single threshold is a well established and widely used classification technique. In this paper, we prove that when spatial cohesion is assumed ...
Tao Zhang, Terrance E. Boult, R. C. Johnson
EUROCRYPT
2007
Springer
14 years 1 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
EDM
2009
116views Data Mining» more  EDM 2009»
13 years 5 months ago
Determining the Significance of Item Order In Randomized Problem Sets
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
Zachary A. Pardos, Neil T. Heffernan