lucasschm

32 ms·

1. 1.▲
   by lucasschm 9y ago

   Yeah, I should have given more thought to that number. Updated the example for N=300. Thanks
2. 2.▲
   by lucasschm 9y ago

   No problem. If there are mistakes or a segment is not clear, let me know
3. 3.▲
   by lucasschm 9y ago

   Bloom Filters? It has false positives but no false negatives
4. 4.▲
   by lucasschm 9y ago

   You are correct, but HyperLogLog has many buckets counting the longest run of zeros in order to avoid the problem of outliers. I recently studied these probabilistic algorithms and did a notebook with code and plots to show their performanc
5. 5.▲
   by lucasschm 9y ago

   For this subject I would like to offer this counter view: Why China bears are wrong: An interview with Andy Rothman ( http://supchina.com/sinica/china-bears-wrong-interview-andy-... ) As it is likely for someone to menti
6. 6.▲
   by lucasschm 9y ago

   Recently I found out that my knowledge about probabilistic algorithms was quite lacking, so I decided to a jupyter notebook about them. I think some of you will find them as interesting as I did. And if there are any mistakes, let me know.
7. 7.▲
   Probabilistic Algorithms: Approximate Counting, *LogLog and Bloom Filters(github.com)

   3 points by lucasschm 9y ago|1 comments