BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Counting Subgraphs in Data Streams - Dr H Sun\, Cluster of Excelle
 nce\, Saarland University
DTSTART:20131029T143000Z
DTEND:20131029T153000Z
UID:TALK48541@talks.cam.ac.uk
CONTACT:Dr Thomas Sauerwald
DESCRIPTION:The recent explosion in the number and scale of real-world str
 uctured graphs including the web\, social and biological networks\, and gr
 aph databases has created a pressing need to efficiently analyze the struc
 tures of massive graphs. While traditional algorithms store the whole grap
 h and cannot even deal with graphs of medium size\, a modern approach is t
 o process the graph as a data stream where edges of the graph come sequent
 ially. Streaming algorithms need to capture the graph structures in sub-li
 near space\, and approximate certain quantities of the underlying graph. I
 n this talk we discuss this line of research including our recent techniqu
 es for counting arbitrary subgraphs in the streaming setting.\n\nBio:\n\nH
 e Sun obtained his PhD from Fudan University in 2010\, and was a PostDoc a
 t the Max Planck Institute for Informatics in Saarbruecken from 2010-2012.
  Since this summer\, He Sun is a leader of a research group on randomized 
 algorithms within the Cluster of Excellence at Saarland University. He is 
 also affiliated with the Max Planck Institute for Informatics as a senior 
 researcher in the Department of Algorithms and Complexity. He Sun’s rese
 arch area lies at the intersection between Algorithm Design and Complexity
  Theory. He has worked extensively in streaming algorithms\, distributed a
 lgorithms and computational geometry.\n
LOCATION:FW11\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR