What was the last paper within the realm of computing you read and loved? What did it inspire you to build or tinker with? Come share the ideas in an awesome academic/research paper with fellow engineers, programmers, and paper-readers. Lead a session and show off code that you wrote that implements these ideas or just give us the lowdown about the paper (because of HARD MATH!). Otherwise, just come, listen, and discuss.
As a Papers We Love chapter we welcome everyone from the programming community for an evening of ideas, vibrant discussions and hanging out with your fellow travellers.
The Barcelona Chapter meets monthly at different locations throughout the city. Keep an eye on our Meetup.com page to find out the latest address.
Please make sure to RSVP before attending to make it easier for us to organize all correctly. You can find our schedule and RSVP here on Meetup.com.
Papers We Love has a Code of Conduct. Please contact one of the Meetup's organizers if anyone is not following it. Be good to each other and to the PWL community!
Sign-up: Please RSVP for meetings via Meetup.com
Contact: jomsdev AT gmail DOT com
Sponsors and Organizers
Data Streams as Random Permutations (Paper) (https://hal.inria.fr/hal-01197221/document)
Presented by Jordi Montes, Research Engineer
Cardinality estimation has a wide range of applications from databases to network systems. The problem has been studied since the 80's and many algorithms have been proposed: Adaptive Sampling, HyperLogLog or Recorinality to say some of them.
In this talk we will discuss why cardinality estimation is an important problem, how it has been solved before and why looking at data streams as random permutations can be useful (Hint: This simple observation allows a wealth of classical and recent results from combinatorics to be recycled, with minimal effort, as estimators for various statistics over data streams.).