Sciweavers

290 search results - page 19 / 58
» Lattice-based computation of Boolean functions
Sort
View
CC
2007
Springer
108views System Software» more  CC 2007»
13 years 7 months ago
Communication vs. Computation
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...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
JELIA
2010
Springer
13 years 6 months ago
Sets of Boolean Connectives That Make Argumentation Easier
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 ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
ICPR
2010
IEEE
14 years 15 hour ago
Boolean Combination of Classifiers in the ROC Space
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...
Wael Khreich, Eric Granger, Ali Miri, R. Sabourin
FCS
2006
13 years 9 months ago
Principles of Optimal Probabilistic Decision Tree Construction
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...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...
DAC
2010
ACM
13 years 11 months ago
Theoretical analysis of gate level information flow tracking
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...
Jason Oberg, Wei Hu, Ali Irturk, Mohit Tiwari, Tim...