Sciweavers

35 search results - page 3 / 7
» Conditions for use of a non-selfintersection conjecture
Sort
View
COCO
2008
Springer
74views Algorithms» more  COCO 2008»
13 years 10 months ago
Approximation Resistant Predicates from Pairwise Independence
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
Per Austrin, Elchanan Mossel
DM
2008
77views more  DM 2008»
13 years 7 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh
WSC
1994
13 years 9 months ago
Consistency of overlapping batch variances
Overlapping batch statistics estimate the variance of point estimators using overlapping batches (Schmeiser, Avramidis and Hashem 1990). In this paper we study sufficient conditio...
Demet C. Wood, Bruce W. Schmeiser
JAIR
2011
114views more  JAIR 2011»
12 years 11 months ago
Properties of Bethe Free Energies and Message Passing in Gaussian Models
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
Botond Cseke, Tom Heskes
FOCS
2009
IEEE
14 years 3 months ago
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...
Yi Deng, Vipul Goyal, Amit Sahai