BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211207T055403Z
LOCATION:Second Floor Atrium
DTSTART;TZID=America/Chicago:20211116T083000
DTEND;TZID=America/Chicago:20211116T170000
UID:submissions.supercomputing.org_SC21_sess278_rpost108@linklings.com
SUMMARY:Hashed-Coordinate Storage of Sparse Tensors
DESCRIPTION:Posters, Research Posters\n\nHashed-Coordinate Storage of Spar
 se Tensors\n\nLowe, Charles, Singh\n\nTensors, or n-way arrays, are becomi
 ng increasingly important in many fields. In recent applications, tensors 
 are extremely sparse and have such a high degree that dense storage become
 s intractable. To address this, several sparse storage formats have been p
 roposed, with most formats being some variation of coordinate-based storag
 e, or COO. These formats are created to optimize the matricized-tensor-tim
 es-Khatri-Rao product (MTTKRP) operation, which they often achieve at the 
 expense of insertion complexity. This paper presents a new hash-based form
 at called HaCOO. HaCOO provides the same speed of insertion and access as 
 is found in dense arrays while storing only non-zero values. This improves
  upon existing sparse formats by providing efficiency in both decompositio
 n and other tensor operations.\n\nRegistration Category: Tech Program Reg 
 Pass, Exhibit Hall Only
END:VEVENT
END:VCALENDAR