71 search results - page 12 / 15 » Approximating Boolean Functions by OBDDs |
63
Voted
ECCC
2007
14 years 9 months ago
2007
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
ICISC
2007
14 years 11 months ago
2007
The starting point for collision attacks on practical hash functions is a local collision. In this paper, we make a systematic study of local collisions for the SHA-2 family. The p...
ICCD
1991
IEEE
15 years 1 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
90
Voted
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
111
Voted
EMNLP
2009
14 years 7 months ago
2009
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...