Comment on xkcd #2934: Bloom Filter
Audalin@lemmy.world 5 months ago
There’s a recent algorithm using somewhat similar ideas for approximate counting of unique objects in a stream with constant memory:
Comment on xkcd #2934: Bloom Filter
Audalin@lemmy.world 5 months ago
There’s a recent algorithm using somewhat similar ideas for approximate counting of unique objects in a stream with constant memory:
Mubelotix@jlai.lu 5 months ago
I think I like hash-based probabilistic counting better, but this is interesting