503 search results - page 9 / 101 » An Independence Relation for Sets of Secrets |
ICANN
2001
Springer
14 years 28 days ago
2001
Springer
Humans tend to group together related properties in order to understand complex phenomena. When modeling large problems with limited representational resources, it is important to...
JGT
2007
13 years 8 months ago
2007
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
ICDE
2010
IEEE
14 years 3 months ago
2010
IEEE
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...
CCS
2003
ACM
14 years 1 months ago
2003
ACM
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
PODS
1995
ACM
13 years 12 months ago
1995
ACM
d abstract Marc Andries, Leiden University Luca Cabibbo, University of Romey Jan Paredaens, University of Antwerpz Jan Van den Bussche, INRIAx In the context of object databases...