40 search results - page 7 / 8 » Bounds for separating hash families |
SIAMDM
1998
14 years 9 months ago
1998
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—The capacity region of the finite-state multiple-access channel (FS-MAC) with feedback that may be an arbitrary timeinvariant function of the channel output samples is consider...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
BMCBI
2008
14 years 9 months ago
2008
Background: Detailed information about protein interactions is critical for our understanding of the principles governing protein recognition mechanisms. The structures of many pr...
HPDC
2002
IEEE
15 years 2 months ago
2002
IEEE
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...