Links for 2014-08-25

This entry was posted in Uncategorized. Bookmark the permalink. Both comments and trackbacks are currently closed.

2 Comments

  1. Posted August 26, 2014 at 01:27 | Permalink

    The comments about number of hash functions and hashing performance are weird. The number of hashes you need is 2, and you calculate the bit indexes by h1 + n*h2. This requires good hash functions, e.g. murmurhash or cryptographic.

  2. Posted August 26, 2014 at 11:59 | Permalink

    hmm, that’s interesting. I think that is an optimisation: http://stackoverflow.com/a/9554448 , http://www.eecs.harvard.edu/~kirsch/pubs/bbbf/esa06.pdf