4255 search results - page 56 / 851 » On Learning Boolean Functions |
145
Voted
DAC
2004
ACM
16 years 6 months ago
2004
ACM
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...
148
click to vote
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
We propose an algorithm for creating superpixels. The major step in our algorithm is simply minimizing two pseudo-boolean functions. The processing time of our algorithm on images...
133
click to vote
ERSHOV
2003
Springer
15 years 10 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
130
Voted
DCC
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...
133
Voted
FFA
2008
15 years 5 months ago
2008
We study the Boolean functions f :F2n F2, n = 6r, of the form f (x) = Tr(xd) with d = 22r + 2r + 1 and F2n . Our main result is the characterization of those for which f are b...