Tabulation hashing

In computer science, tabulation hashing is a method for constructing universal families of hash functions by combining table lookup with exclusive or… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2000-2016
01220002016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Hashing is a basic tool for dimensionality reduction employed in several aspects of machine learning. However, the perfomance… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2016
2016
The power of two choices is a classic paradigm used for assigning m balls to n bins. When placing a ball we pick two bins… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2014
2014
A random hash function h is ε-minwise if for any set S, |S| “ n, and element x P S, Prrhpxq “ minhpSqs “ p1 ̆ εq{n. Minwise hash… (More)
Is this relevant?
2013
2013
  • Mikkel Thorup
  • 2013 IEEE 54th Annual Symposium on Foundations of…
  • 2013
Simple tabulation dates back to Zobrist in 1970 who used it for game playing programs. Keys are viewed as consisting of c… (More)
  • table 1
Is this relevant?
2013
Highly Cited
2011
Highly Cited
2011
Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical… (More)
  • figure 1
Is this relevant?
2005
2005
In the last lecture, we finished up talking about memory hierarchies and linked cache-oblivious data structures with geometric… (More)
Is this relevant?
Review
2000
Review
2000
Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic… (More)
Is this relevant?