Probabilistic Data Structures Are OZMM

Shu Chen (local genius wunderkind) will discuss the reasoning and implementation of two useful data structures (bloom filter and flower filter), both useful to big data applications, optimization, and impressing your colleagues.

Read up on bloom filters via Wikipedia:
http://en.wikipedia.org/wiki/Bloom_filter

Please note, this talk takes place in the 2nd floor conference room (a.k.a. the board room). It's across the courtyard from the main (outdoor) staircase.