Sciweavers

4255 search results - page 51 / 851
» On Learning Boolean Functions
Sort
View
ISMVL
2010
IEEE
186views Hardware» more  ISMVL 2010»
14 years 2 months ago
A Classification of Partial Boolean Clones
We study intervals I(A) of partial clones whose total functions constitute a (total) clone A. In the Boolean case, we provide a complete classification of such intervals (accordin...
Dietlinde Lau, Karsten Schölzel
FOCS
1991
IEEE
14 years 1 months ago
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
Anna Gál
COCO
2010
Springer
135views Algorithms» more  COCO 2010»
14 years 2 months ago
Lower Bounds for Testing Function Isomorphism
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Eric Blais, Ryan O'Donnell
TNN
1998
254views more  TNN 1998»
13 years 9 months ago
Periodic symmetric functions, serial addition, and multiplication with neural networks
Abstract—This paper investigates threshold based neural networks for periodic symmetric Boolean functions and some related operations. It is shown that any n-input variable perio...
Sorin Cotofana, Stamatis Vassiliadis
PVLDB
2010
110views more  PVLDB 2010»
13 years 8 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor