xkcd
A community for a webcomic of romance, sarcasm, math, and language.
For anyone interested in learning more about bloom filters, this is a technical but extremely accessible and easy to follow introduction to them, including some excellent interactive visualizations: https://samwho.dev/bloom-filters/
This was a great read, thanks for sharing!
Is'nt bloom filter a shader that makes the picture look hazy and bright?
That's the bloom shader effect: https://en.wikipedia.org/wiki/Bloom_(shader_effect)
But yeah, some people might refer to that as "bloom filter", although it's not what's meant here.
Thanks
A bloom filter is a data structure that is most useful in creating a spell check algorithm
There's a recent algorithm using somewhat similar ideas for approximate counting of unique objects in a stream with constant memory:
https://www.quantamagazine.org/computer-scientists-invent-an-efficient-new-way-to-count-20240516/
I think I like hash-based probabilistic counting better, but this is interesting