BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20151025T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20150329T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.7095.field_data.0@oba.diag.uniroma1.it
DTSTAMP:20260405T053356Z
CREATED:20150710T103838Z
DESCRIPTION:In the last years we have observed the emergence of a variety o
 f systems where users communicate and collaborate online\, explicitely or 
 implicitely\, producing knowledge and new services. Success stories includ
 e Wikipedia\, Linux and the open source community\, crowdsourcing services
 \, online labor marketplaces\, and social-media platforms\, to name a few.
  This new paradigm\, where users collaborate using the Internet for coordi
 nation\, requires the development of new models and algorithms to capture\
 , aggregate\, and organize the contribution of humans. In this talk I will
  start with a high-level presentation of some of these systems and with so
 me of the issues needed to be captured when trying to formally model them.
  In particular I will present models and algorithms for assigning users on
  crowdsourcing systems and of methods for distilling information from soci
 al-media and sensor networks. Furthermore\, I will describe some current w
 ork on the network effect on the 'wisdom fo the crowds.' I will conclude w
 ith a discussion of challenges for future work. Bio: Aristidis Anagnostopo
 ulos is an assistant professor at the Department of Computer\, Control\, a
 nd Management Engineering (DIAG) at Sapienza University of Rome\, since 20
 12. He obtained his Ph.D. from Brown University in 2006\, afterwards he di
 d a postdoc at Yahoo! Research in Silicon Valley and from 2010 to 2009 he 
 was a Marie-Curie Fellow at DIAG. His main research interests include rand
 omized and approximation algorithms and their applications on data mining\
 , social networks\, and web search.
DTSTART;TZID=Europe/Paris:20150715T100000
DTEND;TZID=Europe/Paris:20150715T100000
LAST-MODIFIED:20150714T090125Z
LOCATION:Aula A3\, DIAG\, Via Ariosto 25\, Roma
SUMMARY:Models and Algorithms for Online Crowd Systems - Aristidis Anagnost
 opoulos
URL;TYPE=URI:http://oba.diag.uniroma1.it/node/7095
END:VEVENT
END:VCALENDAR
