4255 search results - page 155 / 851 » On Learning Boolean Functions |
165
click to vote
ICALT
2010
IEEE
15 years 4 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...
165
click to vote
CADE
2006
Springer
16 years 6 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 ...
187
click to vote
ICALP
2009
Springer
16 years 6 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 ...
128
click to vote
ICCAD
2007
IEEE
16 years 3 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 ...
194
click to vote
ASIACRYPT
2005
Springer
16 years 9 hour 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...