706 search results - page 52 / 142 » On a quasi-ordering on Boolean functions |
UC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
ICPR
2010
IEEE
14 years 1 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...
APAL
2004
13 years 8 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
PODS
2000
ACM
14 years 1 months ago
2000
ACM
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
ADBIS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The performance of an information retrieval system is usually measured in terms of two different criteria, precision and recall. This way, the optimization of any of its...