BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20070311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20071104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69b6feb2090dc
DTSTART;TZID=America/Toronto:20071214T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20071214T113000
URL:https://uwaterloo.ca/artificial-intelligence-group/events/ai-seminar-cl
 ustering-google-distance-using-graph-cuts
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 2306C (AI lab) Waterloo ON N2L 3G1 Canada
SUMMARY:AI seminar: Clustering the google distance using graph cuts
CLASS:PUBLIC
DESCRIPTION:Speaker: Thomas Zeugmann\, Hokkaido University\, Japan\n\nClust
 ering algorithms working with a matrix of pairwise similarities\n(kernel m
 atrix) for the data are widely known and used\, a particularly\npopular cl
 ass being spectral clustering algorithms. In contrast\,\nalgorithms workin
 g with the pairwise distance matrix have been studied\nrarely for clusteri
 ng. This is surprising\, as in many applications\,\ndistances are directly
  given\, and computing similarities involves\nanother step that is error-p
 rone\, since the kernel has to be chosen\nappropriately\, albeit computati
 onally cheap.
DTSTAMP:20260315T184714Z
END:VEVENT
END:VCALENDAR