Jump to content

Category:Probabilistic data structures

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Damian Yerrick (talk | contribs) at 02:34, 8 May 2013 (cat:Lossy compression because the typical advantage over an exact data structure, such as with a Bloom filter, is size). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.