Sciweavers

71 search results - page 11 / 15
» Approximating Boolean Functions by OBDDs
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
14 years 1 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 8 months ago
Reimer's inequality and tardos' conjecture
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
Clifford D. Smyth
ICCD
2005
IEEE
116views Hardware» more  ICCD 2005»
14 years 5 months ago
Enhanced Dual-Transition Probabilistic Power Estimation with Selective Supergate Analysis
Consideration of pairs of transition in probabilistic simulation allows power estimation for digital circuits in which inertial delays can filter glitches [5]. However, the merit ...
Fei Hu, Vishwani D. Agrawal
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 9 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
ICDE
1998
IEEE
121views Database» more  ICDE 1998»
14 years 10 months ago
Fuzzy Triggers: Incorporating Imprecise Reasoning into Active Databases
Traditional Event-Condition-Action triggers (active database rules) include a Boolean predicate as a trigger condition. We propose fuzzy triggers whereby fuzzy inference is utiliz...
Antoni Wolski, Tarik Bouaziz