Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re^2: [OT] The statistics of hashing.

by roboticus (Chancellor)
on Apr 02, 2012 at 14:07 UTC ( #963013=note: print w/ replies, xml ) Need Help??


in reply to Re: [OT] The statistics of hashing.
in thread [OT] The statistics of hashing.

Oh, something I forgot to mention: I tried using a constant number of bits but varying the vector size/quantity to see how things scaled. In other words, I compared:

vec size# vectors
10,000 1
5,000 2
3,333 3
2,500 4
2,000 5
1,00010

I found more smaller vectors works better until the number of samples matches the number if bits in the smaller vector. Plotting the functions:

(1-exp(-x/1000))^10 (1-exp(-x/2000))^5 (1-exp(-x/2500))^4 (1-exp(-x/3333))^3 1-exp(-x/10000)

using a graphing calculator shows that's where the curves cross:

...roboticus

When your only tool is a hammer, all problems look like your thumb.


Comment on Re^2: [OT] The statistics of hashing.
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://963013]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (14)
As of 2015-07-02 09:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (33 votes), past polls