4255 search results - page 155 / 851 » On Learning Boolean Functions |
ICALT
2010
IEEE
14 years 8 months ago
2010
IEEE
Emotions have a functional relevance to learning and achievement. Not surprisingly then, affective diagnoses are an important aspect of expert human mentoring. Computerbased learni...
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
75
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
ICCAD
2007
IEEE
15 years 7 months ago
2007
IEEE
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...