BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Robust Distance Queries on Massive Networks  - Milan Vojnovic
DTSTART:20141020T094500Z
DTEND:20141020T104500Z
UID:TALK55632@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:I will present a versatile and scalable algorithm for computin
 g exact distances on real-world networks with tens of millions of arcs in 
 real time. Unlike existing approaches\, preprocessing and queries are prac
 tical on a wide variety of inputs\, such as social\, communication\, senso
 r\, and road networks. We achieve this by providing a unified approach bas
 ed on the concept of 2-hop labels\, improving upon existing methods. In pa
 rticular\, we introduce a fast sampling-based algorithm to order vertices 
 by importance\, as well as effective compression techniques.\nTowards the 
 end I will also briefly talk about other projects that I was pursuing at M
 icrosoft Research Silicon Valley. In particular\, I will present an effici
 ent and highly scalable algorithm for influence maximization in social net
 works. Here\, we are interested in computing a small set of entities of th
 e network that in their entirety influence as many others as possible. Thi
 s has applications\, e.g.\, for viral marketing and rumor spreading. \n
LOCATION:Small Lecture Theatre\, Microsoft Research Ltd\, 21 Station Road\
 , Cambridge\, CB1 2FB
END:VEVENT
END:VCALENDAR