706 search results - page 86 / 142 » On a quasi-ordering on Boolean functions |
DAM
2008
13 years 9 months ago
2008
We propose a generic model for the "weighted voting" aggregation step performed by several methods in supervised classification. Further, we construct an algorithm to en...
ICML
1999
IEEE
14 years 10 months ago
1999
IEEE
: Numerical function approximation over a Boolean domain is a classical problem with wide application to data modeling tasks and various forms of learning. A great many function ap...
STOC
1996
ACM
14 years 1 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
DC
2010
13 years 9 months ago
2010
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...