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...
Jan Adem, Yves Crama, Willy Gochet, Frits C. R. Sp...
: 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...
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...
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 ...
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...