3 search results - page 1 / 1 » Tabulation Based 5-Universal Hashing and Linear Probing |
ALENEX
2010
13 years 6 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
SIAMCOMP
2012
11 years 7 months ago
2012
Abstract. In the framework of Carter and Wegman, a k-independent hash function maps any k keys independently. It is known that 5independent hashing provides good expected performan...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...