BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20220812T074358Z
LOCATION:Samarkand Room
DTSTART;TZID=Europe/Stockholm:20220627T111500
DTEND;TZID=Europe/Stockholm:20220627T121500
UID:submissions.pasc-conference.org_PASC22_sess175@linklings.com
SUMMARY:AP1D - ACM Papers Session 1D
DESCRIPTION:Paper\n\nCommunication Bounds for Convolutional Neural Network
 s\n\nChen, Demmel, Dinh, Haberle, Holtz\n\nConvolutional neural networks (
 CNNs) are important in a wide variety of machine learning tasks and applic
 ations, so optimizing their performance is essential. Moving words of data
  between levels of a memory hierarchy or between processors on a network i
 s much more expensive than the cost of arithmet...\n\n--------------------
 -\nToward a Big Data Analysis System for Historical Newspaper Collections 
 Research\n\nPuthanveetil Satheesan, Bhavya, Davies, Craig, Zhang...\n\nThe
  availability and generation of digitized newspaper collections have provi
 ded researchers in several domains with a powerful tool to advance their r
 esearch. More specifically, digitized historical newspapers give us a magn
 ifying glass into the past. In this paper, we propose a scalable and custo
 m...\n\n\nDomain: Computer Science and Applied Mathematics, Humanities and
  Social Sciences
END:VEVENT
END:VCALENDAR