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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69db8555e31d5
DTSTART;TZID=America/Toronto:20180420T223000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180420T223000
URL:https://uwaterloo.ca/data-systems-group/events/dsg-seminar-series-speed
 up-set-intersections-graph
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:DSG Seminar Series • Speedup Set Intersections in Graph Algorithm
 s\nusing SIMD Instructionsnotes
CLASS:PUBLIC
DESCRIPTION:LEI ZOU\, INSTITUTE OF COMPUTER SCIENCE AND TECHNOLOGY\n_Peking
  __University_\n\n_​_In this talk\, I focus on accelerating a widely emp
 loyed computing\npattern — set intersection\, to boost a group of releva
 nt graph\nalgorithms. Graph’s adjacency-lists can be naturally considere
 d as\nnode sets\, thus set intersection is a primitive operation in many\n
 graph algorithms. We propose QFilter\, a set intersection algorithm\nusing
  SIMD instructions. QFilter adopts a merge-based framework and\ncompares t
 wo blocks of elements iteratively by SIMD instructions.
DTSTAMP:20260412T114317Z
END:VEVENT
END:VCALENDAR