63 search results - page 6 / 13 » Boolean Functions for Finite-Tree Dependencies |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
PODS
2010
ACM
13 years 7 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Modern data mining settings involve a combination of attributevalued descriptors over entities as well as specified relationships between these entities. We present an approach t...
DATE
1998
IEEE
13 years 11 months ago
1998
IEEE
We present a new combinational verification technique where the functional specification of a circuit under verification is utilized to simplify the verification task. The main id...