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:Singapore Room
DTSTART;TZID=Europe/Stockholm:20220628T150000
DTEND;TZID=Europe/Stockholm:20220628T160000
UID:submissions.pasc-conference.org_PASC22_sess177@linklings.com
SUMMARY:AP2B - ACM Papers Session 2B
DESCRIPTION:Paper\n\nFIST-HOSVD: Fused In-Place Sequentially Truncated Hig
 her Order Singular Value Decomposition\n\nCobb, Kolla, Phipps, Çatalyürek\
 n\nIn this paper, several novel methods of improving the memory locality o
 f the Sequentially Truncated Higher Order Singular Value Decomposition (ST
 -HOSVD) algorithm for computing the Tucker decomposition are presented. We
  show how the two primary computational kernels of the ST-HOSVD can be fus
 ed toge...\n\n---------------------\nScalable Low-Rank Factorization Using
  a Task-Based Runtime System with Distributed Memory\n\nGnanasekaran, Darv
 e\n\nWe present a new parallel task-based algorithm for randomized low-ran
 k factorizations of a matrix and its application to fast hierarchical solv
 ers. TaskTorrent is a lightweight, distributed, task-based runtime in C++.
  We explain how the randomized factorization can be expressed as a task gr
 aph in Ta...\n\n\nDomain: Computer Science and Applied Mathematics
END:VEVENT
END:VCALENDAR