2157 search results - page 2 / 432 » Optimal Fast Hashing |
FSE
2008
Springer
13 years 6 months ago
2008
Springer
Hash functions are an important building block in almost all security applications. In the past few years, there have been major advances in the cryptanalysis of hash functions, es...
WG
1993
Springer
13 years 9 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
SIGIR
2010
ACM
13 years 9 months ago
2010
ACM
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
SIGCOMM
2009
ACM
13 years 11 months ago
2009
ACM
As forwarding tables and link speeds continue to grow, fast packet forwarding becomes increasingly challenging for enterprise edge routers. Simply building routers with ever large...