Definitions from Wiktionary (Bloom filter)
▸ noun: (computing theory) A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not.
▸ Words similar to Bloom filter
▸ Usage examples for Bloom filter
▸ Idioms related to Bloom filter
▸ Wikipedia articles (New!)
▸ Words that often appear near Bloom filter
▸ Rhymes of Bloom filter
▸ Invented words related to Bloom filter
▸ noun: (computing theory) A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not.
Similar:
Bloch function,
overfilter,
Boolean,
filter,
underfilter,
Borel function,
Blum's speedup theorem,
bifiltration,
comb filter,
free ultrafilter,
more...
Opposite:
Phrases:
▸ Words similar to Bloom filter
▸ Usage examples for Bloom filter
▸ Idioms related to Bloom filter
▸ Wikipedia articles (New!)
▸ Words that often appear near Bloom filter
▸ Rhymes of Bloom filter
▸ Invented words related to Bloom filter