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:20131027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20130331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20140330T020000
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.6735.field_data.0@www.open.diag.uniroma1.it
DTSTAMP:20260410T135105Z
CREATED:20130920T093420Z
DESCRIPTION:Matching Dependencies (MDs) are logical rules that specify that
   certain attribute values have to be made equal when certain  similarity 
 conditions on other attribute values hold in a database.  MDS are meant to
  be used for entity resolution (ER)\, which is the  data cleaning problem 
 of merging into a singlerepresentation possibly several representations in
  the database of  the same external entity.In this talk we present recent 
 research around MDs\, including  alternative semantics for MDs\, query ans
 wering under MDs and its  complexity\, and logical specifications of the i
 ntended clean  instances after MD-based ER. 
DTSTART;TZID=Europe/Paris:20130923T120000
DTEND;TZID=Europe/Paris:20130923T120000
LAST-MODIFIED:20240620T113644Z
LOCATION:Aula A2\, DIAG\, Via Ariosto 25\, piano terra
SUMMARY:Seminar: Prof. Leopoldo Bertossi - September\, 23\, 2013 at 12.00am
  - Leopoldo Bertossi (Carleton University \, Ottawa\, Canada)
URL;TYPE=URI:http://www.open.diag.uniroma1.it/node/6735
END:VEVENT
END:VCALENDAR