4438 search results - page 55 / 888 » On the Distribution of Keys by Hashing |
128
click to vote
STOC
2002
ACM
16 years 4 days ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
ATAL
2010
Springer
15 years 29 days ago
2010
Springer
Although a remarkably high degree of automation has been reached in production and intra-logistics nowadays, human labor is still used for transportation using handcarts and forkl...
ASIACRYPT
1999
Springer
15 years 4 months ago
1999
Springer
This paper presents a weakness in the key schedule of the AES candidate HPC (Hasty Pudding Cipher). It is shown that for the HPC version with a 128-bit key, 1 in 256 keys is weak i...
104
click to vote
ICPR
2010
IEEE
14 years 9 months ago
2010
IEEE
Finding similar images in a large database is an important, but often computationally expensive, task. In this paper, we present a two-tier similar-image retrieval system with the...