68 search results - page 5 / 14 » Propagation Characteristics of Boolean Functions |
FCT
2001
Springer
14 years 10 days ago
2001
Springer
In this paper dense families of database relations are introduced. We characterize dependencies and keys of relation instances in terms of dense families. Key functions are also in...
CSREAESA
2004
13 years 9 months ago
2004
- The model of a simple perceptron using phase-encoded inputs and complex-valued weights is presented. Multilayer two-input and three-input complex-valued neurons (CVNs) are implem...
FSE
2005
Springer
14 years 1 months ago
2005
Springer
For the power consumption model called Hamming weight model, we rewrite DPA attacks in terms of correlation coefficients between two Boolean functions. We exhibit properties of S-b...
ICCAD
1999
IEEE
14 years 4 days ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
PVLDB
2010
13 years 6 months ago
2010
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...