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:20260522T150118Z
LOCATION:C141/143/149
DTSTART;TZID=America/Chicago:20181113T153000
DTEND;TZID=America/Chicago:20181113T170000
UID:submissions.supercomputing.org_SC18_sess212@linklings.com
SUMMARY:Algorithms on Sparse Data
DESCRIPTION:Distributed Memory Sparse Inverse Covariance Matrix Estimation
  on High-Performance Computing Architectures\n\nWe consider the problem of
  estimating sparse inverse covariance matrices for high-dimensional datase
 ts using the l1-regularized Gaussian maximum likelihood method. This task 
 is particularly challenging as the required computational resources increa
 se superlinearly with the dimensionality of the data...\n\n\nAryan Eftekha
 ri (University of Lugano), Matthias Bollhöfer (Braunschweig University of 
 Technology), and Olaf Schenk (University of Lugano)\n---------------------
 \nPruneJuice:  Pruning Trillion-Edge Graphs to a Precise Pattern-Matching 
 Solution\n\nPattern matching is a powerful graph analysis tool. Unfortunat
 ely, existing solutions have limited scalability, support only a limited s
 et of search patterns, and/or focus on only a subset of the real-world pro
 blems associated with pattern matching. This paper presents a new algorith
 mic pipeline tha...\n\n\nTahsin Reza, Matei Ripeanu, and Nicolas Tripoul (
 University of British Columbia) and Geoffrey Sanders and Roger Pearce (Law
 rence Livermore National Laboratory)\n---------------------\nHiCOO: Hierar
 chical Storage of Sparse Tensors\n\nThis paper proposes a new storage form
 at for sparse tensors, called Hierarchical COOrdinate (HiCOO; pronounced: 
 “haiku”). It derives from coordinate (COO) format, arguably the de facto s
 tandard for general sparse tensor storage. HiCOO improves upon COO by comp
 ressing the indices in units of sparse t...\n\n\nJiajia Li, Jimeng Sun, an
 d Richard Vuduc (Georgia Institute of Technology)\n\nTag: Algorithms, Grap
 h Algorithms, Linear Algebra, Machine Learning, Sparse Computation\n\nRegi
 stration Category: Tech Program Reg Pass\n\nFinalist: BSP Finalist\n\nSess
 ion Chair: Howie Huang (George Washington University)
END:VEVENT
END:VCALENDAR