707 search results - page 91 / 142 » The Nonhomomorphicity of Boolean Functions |
JMLR
2002
13 years 7 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
MST
2010
13 years 6 months ago
2010
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
ICIP
2010
IEEE
13 years 6 months ago
2010
IEEE
This work presents a novel parallel technique to implement stack morphological filters for image processing. The method relies on applying the image bitwise decomposition to manip...
FLAIRS
2009
13 years 5 months ago
2009
Empirical testing is a very popular evaluation method for the development of intelligent systems. Here, previously solved problems with correct solutions are given as cases to the...