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:20210808T235332Z
LOCATION:Room C
DTSTART;TZID=America/Chicago:20210811T103000
DTEND;TZID=America/Chicago:20210811T113000
UID:icpp_ICPP 2021_sess125@linklings.com
SUMMARY:4C: Algorithms and Applications
DESCRIPTION:Conference Paper\n\nAccelerating DBSCAN Algorithm with AI Chip
s for Large Datasets\n\nJi, Wang\n\nDBSCAN is a popular clustering algorit
hm, which shows great success in many real-world applications. Its advanta
ges come at the expense of massive computation, especially for computing t
he distance matrix. Driven by deep learning, many Artificial Intelligence
(AI) chips have been developed. With eff...\n\n---------------------\nGene
ralized Skyline Interval Coloring and Dynamic Geometric Bin Packing Proble
ms\n\nRen, Tang\n\nWe consider two combinatorial optimization problems, na
med Generalized Skyline Interval Coloring (GSIC) and Dynamic Geometric Bin
Packing (DGBP). The input to both problems is a set of interval jobs, wit
h each job specified by a horizontal active time interval and a vertical s
ize. For GSIC, each job...\n\n---------------------\nParallel Tucker Decom
position with Numerically Accurate SVD\n\nLi, Fang, Ballard\n\nTucker deco
mposition is a low-rank tensor approximation that generalizes a truncated
matrix singular value decomposition (SVD). Existing parallel software has
shown that Tucker decomposition is particularly effective at compressing t
erabyte-sized multidimensional scientific simulation datasets, comp...\n\n
---------------------\nEfficient Parallel Algorithms for String Comparison
\n\nMishin, Berezun, Tiskin\n\nThe longest common subsequence (LCS) proble
m on a pair of strings is a classical problem in string algorithms.\nIts e
xtension, the semi-local LCS problem, provides a more detailed comparison
of the input strings, without any increase in asymptotic running time.\nSe
veral semi-local LCS algorithms have ...\n
END:VEVENT
END:VCALENDAR