Sciweavers

351 search results - page 3 / 71
» On the Learnability of Boolean Formulae
Sort
View
SIAMCOMP
2008
109views more  SIAMCOMP 2008»
13 years 6 months ago
On Monotone Formula Composition of Perfect Zero-Knowledge Languages
We investigate structural properties of interactive perfect zero-knowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean ...
Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe...
FCS
2006
13 years 9 months ago
Discovering the Impact of Group Structure on 3-SAT
-- Boolean SAT problems are widespread in current demanding applications, most notably model checking for both hardware and software. It has long been known that the clause-to-vari...
James McQuillan, Craig Damon
CINQ
2004
Springer
118views Database» more  CINQ 2004»
14 years 1 months ago
Boolean Formulas and Frequent Sets
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
Jouni K. Seppänen, Heikki Mannila
FOCS
1989
IEEE
13 years 11 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
IJCAI
2007
13 years 9 months ago
Learning from Partial Observations
We present a general machine learning framework for modelling the phenomenon of missing information in data. We propose a masking process model to capture the stochastic nature of...
Loizos Michael