BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Reading Group - Network Applications of Bloom Filters: A Survey - 
 Pedro Brandao (University of Cambridge)
DTSTART:20081014T133000Z
DTEND:20081014T143000Z
UID:TALK13394@talks.cam.ac.uk
CONTACT:Pedro Brandao
DESCRIPTION:*Note the unusual room*\n\n*Slides "available":http://www.cl.c
 am.ac.uk/research/srg/opera/meetings/attachments/2008-10-14-BloomFiltersSu
 rvey.pdf .*\n\nFrom the reading group list I'll be _"reading"_ "Network Ap
 plications of Bloom Filters: A Survey":http://www.projecteuclid.org/DPubS?
 verb=Display&version=1.0&service=UI&handle=euclid.im/1109191032&page=recor
 d\n\nAndrei Broder and Michael Mitzenmacher\,_Internet Math. Volume 1\, Nu
 mber 4 (2003)\, 485-509._\n\n*Abstract:*\n\nA Bloom filter is a simple spa
 ce-efficient randomized data structure for representing a set in order to 
 support membership queries. Bloom filters allow false positives but the sp
 ace savings often outweigh this drawback when the probability of an error 
 is controlled. Bloom filters have been used in database applications since
  the 1970s\, but only in recent years have they become popular in the netw
 orking literature. The aim of this paper is to survey the ways in which Bl
 oom filters have been used and modified in a variety of network problems\,
  with the aim of providing a unified mathematical and practical framework 
 for understanding them and stimulating their use in future applications.
LOCATION:Room FW26\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR