☆ Yσɠƚԋσʂ ☆@lemmy.ml to General Programming Discussion@lemmy.mlEnglish · 1 month agoTwo Bits Are Better Than One: making bloom filters 2x more accuratefloedb.aiexternal-linkmessage-square7linkfedilinkarrow-up114arrow-down10
arrow-up114arrow-down1external-linkTwo Bits Are Better Than One: making bloom filters 2x more accuratefloedb.ai☆ Yσɠƚԋσʂ ☆@lemmy.ml to General Programming Discussion@lemmy.mlEnglish · 1 month agomessage-square7linkfedilink
minus-squarePungent Llama@lemmy.worldlinkfedilinkarrow-up4·1 month agoIt’s a precomputed hash that let’s you know if an item is (kinda) in a set or not. Fast and uses up very little space. See: https://en.wikipedia.org/wiki/Bloom_filter What you are talking about with graphics is: https://en.wikipedia.org/wiki/Bloom_(shader_effect)
It’s a precomputed hash that let’s you know if an item is (kinda) in a set or not. Fast and uses up very little space.
See: https://en.wikipedia.org/wiki/Bloom_filter
What you are talking about with graphics is: https://en.wikipedia.org/wiki/Bloom_(shader_effect)