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:20171029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20170326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20180325T020000
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.12927.field_data.0@www.ugov-ricerca.uniroma1.it
DTSTAMP:20260407T215717Z
CREATED:20171009T124654Z
DESCRIPTION:As an optimization problem\, clustering exhibits a strikingphen
 omenon: It is generally regarded as easy in practice\, while theoryclassif
 ies it among the computationally intractable problems. To addressthis dich
 otomy\, research has identified a number of conditions a data setmust sati
 sfy for a clustering to be (1) easily computable and (2)meaningful.In this
  talk we show that all previously proposed notions of struturednessof a da
 ta set are fundamentally local properties\, i.e. the global optimumis in w
 ell defined sense close to a local optimum. As a corollary\, thisimplies t
 hat  the Local Search heuristic has strong performance guaranteesfor both 
 the tasks of recovering the underlying optimal clustering andobtaining a c
 lustering of small cost.Joint work with Vincent Cohen-Addad
DTSTART;TZID=Europe/Paris:20171012T140000
DTEND;TZID=Europe/Paris:20171012T140000
LAST-MODIFIED:20191008T082902Z
LOCATION:Aula Magna DIAG\, via Ariosto 25\, I floow
SUMMARY:Chris Schwiegelsohohn: On the Local Structure of Stable Clustering 
 Instances - Chris Schwiegelshohn\, DIAG\, Sapienza University of Rome
URL;TYPE=URI:http://www.ugov-ricerca.uniroma1.it/node/12927
END:VEVENT
END:VCALENDAR