290 search results - page 19 / 58 » Lattice-based computation of Boolean functions |
120
click to vote
CC
2007
Springer
15 years 3 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
159
click to vote
JELIA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
138
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
Using Boolean AND and OR functions to combine the responses of multiple one- or two-class classifiers in the ROC space may significantly improve performance of a detection system o...
118
click to vote
FCS
2006
15 years 4 months ago
2006
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
109
click to vote
DAC
2010
ACM
15 years 7 months ago
2010
ACM
Understanding the flow of information is an important aspect in computer security. There has been a recent move towards tracking information in hardware and understanding the flow...