Prezi - The Zooming Presentation Editor:
Apresentação com zoom.
'via Blog this'
quinta-feira, 12 de abril de 2012
terça-feira, 10 de abril de 2012
Bloom filter - Wikipedia, the free encyclopedia
Bloom filter - Wikipedia, the free encyclopedia:
Bloom filter, conceived by Burton Howard Bloom in 1970,[1] is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not; i.e. a query returns either "inside set (may be wrong)" or "definitely not in set". Elements can be added to the set, but not removed (though this can be addressed with a counting filter). The more elements that are added to the set, the larger the probability of false positives.
'via Blog this'
Bloom filter, conceived by Burton Howard Bloom in 1970,[1] is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not; i.e. a query returns either "inside set (may be wrong)" or "definitely not in set". Elements can be added to the set, but not removed (though this can be addressed with a counting filter). The more elements that are added to the set, the larger the probability of false positives.
'via Blog this'
Assinar:
Postagens (Atom)