Algorithms Seminar - Fall 2026
The Algorithms Seminar features roughly bi-weekly talks on topics related to algorithms and computational methods. The topics are anything related to algorithms. We currently have in-house expertise in neuromorphic algorithms, quantum algorithms, computational geometry, optimization algorithms, coding based cryptography, symbolic computation, randomized numerical methods, reinforcement learning, and parallel algorithms.
Time: Fridays, 10:00am - 11:00am
Location: SP2 340K
Friday, September 25, 2026
Shamik Khowala - The Harker School
Approximating CDTW Distance of Piecewise Algebraic Curves
Abstract
Curves as input data naturally arise in a variety of fields including finance, seismology, medicine, spatio-temporal data mining, malicious activity detection, and more. A common way to analyze these data sets is similarity matching, for which we need metrics that measure the similarity between curves. I will explore the Continuous Dynamic Time Warping (CDTW) distance: how it improves on previous, more common metrics; existing algorithms for computing it exactly or approximatively for various cases; and finally our own novel algorithm for approximating it between piecewise algebraic curves.
Friday, October 2, 2026
Friday, October 9, 2026
Vinny Miller - UT San Antonio
Title TBD
Friday, October 16, 2026
Friday, October 23, 2026
Friday, October 30, 2026
Friday, November 6, 2026
Friday, November 13, 2026
Friday, November 20, 2026
Sazia Rahman - UT San Antonio
Title TBD
Friday, November 27, 2026
Friday, December 4, 2026