12 search results - page 1 / 3 » Simple summaries for hashing with choices |
TON
2008
13 years 3 months ago
2008
In a multiple-choice hashing scheme, each item is stored in one of 2 possible hash table buckets. The availability of these multiple choices allows for a substantial reduction in t...
STOC
2001
ACM
14 years 5 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
ICC
2009
IEEE
13 years 2 months ago
2009
IEEE
Cryptographic hash functions are often built on block ciphers in order to reduce the security of the hash to that of the cipher, and to minimize the hardware size. Proven secure co...