Ok, so excuse me for being a nub but I'm not having much luck searching wikipedia/the web for an answer to my problem.
I've been trying to implement a generalized cuckoo hashing schema with a scalable number of hash functions (this also has applications to my pre-existing bloom filter application if I can get this working). The problem I'm having is trying to "sample without replacement" in stats terms. I would like my hashes to all be unique locations in my table that way I don't waste time mapping twice to the same space. AFAIK this should also increase the uniformity of my functions since there are a triangular number fewer possibilities to choose from when sampling without replacement.
I've got a nice hash function already, and the ability to generate enough uniformly distributed bits to hash k times, it's just that I'm having trouble with the uniqueness aspect.
Also, if any clarification is needed, I will most surely provide it.
lefthandmanMember Since 23 Feb 2009
Offline Last Active May 03 2012 12:41 AM
- Group Members
- Active Posts 35
- Profile Views 532
- Member Title Member
- Age Age Unknown
- Birthday Birthday Unknown
lefthandman hasn't added any contacts yet.