BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:71@lincs.fr
DTSTART;TZID=Europe/Paris:20151202T140000
DTEND;TZID=Europe/Paris:20151202T143000
DTSTAMP:20170313T170938Z
URL:https://www.lincs.fr/events/an-overview-of-scheduling-resources-in-a-p
 ublic-cloud-2/
SUMMARY:Finding dense subgraphs and interesting events in social networks
DESCRIPTION:Algorithms for finding dense subgraphs are an important
 subroutine in many data mining tasks\, in particular\, community and event
 detection in social networks. Huge amount of data is produced daily by
 Facebook and Twitter users\, calling for efficient algorithms being able to
 handle large amount of data evolving over time. In this talk\, we shall
 present algorithms for efficiently finding dense subgraphs in an evolving
 graph and discuss some preliminary results on how they can be used for
 automatically finding interesting events in social networks.
CATEGORIES:Seminars,Youtube
LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\,
 France
GEO:48.8283983;2.3568972000000485
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\,
 Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room
 40:geo:48.8283983,2.3568972000000485
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20151025T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR