- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for kn (0.14 sec)
-
android/guava/src/com/google/common/hash/BloomFilter.java
// Cheat sheet: // // m: total bits // n: expected insertions // b: m/n, bits per insertion // p: expected false positive probability // // 1) Optimal k = b * ln2 // 2) p = (1 - e ^ (-kn/m))^k // 3) For optimal k: p = 2 ^ (-k) ~= 0.6185^b // 4) For optimal k: m = -nlnp / ((ln2) ^ 2) /** * Computes the optimal k (number of hashes per element inserted in Bloom filter), given the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0)