BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Computer Science - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Computer Science
X-ORIGINAL-URL:https://www.cs.jhu.edu
X-WR-CALDESC:Events for Department of Computer Science
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20270314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20271107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20260609T103000
DTEND;TZID=America/New_York:20260609T120000
DTSTAMP:20260603T140601
CREATED:20260527T155143Z
LAST-MODIFIED:20260601T134110Z
UID:1994942-1781001000-1781006400@www.cs.jhu.edu
SUMMARY:CS Seminar Series: Sketching and Uncertainty: Through the Geometric Lens
DESCRIPTION:LOCATION UPDATE: This seminar will now take place in 107 Malone Hall. \nRefreshments are available starting at 10:30 a.m. The seminar will begin at 10:45 a.m. \nAbstract\nIn many modern applications—including machine learning\, robotics\, distributed systems\, and network design—the input data\, often represented as points in a finite metric space\, can be massive in size. Efficient processing of such data requires compact representations that preserve the essential structural properties of the underlying space. Metric sketching provides a principled approach to achieving this compression. Among the most fundamental metric sketching primitives are spanners and tree covers\, which capture distance relationships in a concise form. \nIn the first part of the talk\, Sujoy Bhore will discuss recent advances in geometric sketching. Traditional algorithmic models often assume complete knowledge of the input in advance; however\, this assumption breaks down in evolving environments where the input changes over time. In these settings\, algorithms must continuously adapt while maintaining strong performance guarantees. In the second part of the talk\, Bhore will explore dynamic aspects of metric sketching\, discuss related problems\, and highlight emerging directions at the interface of geometry and uncertainty. \nSpeaker Biography\nSujoy Bhore is a faculty member in the Department of Computer Science and Engineering at the Indian Institute of Technology Bombay and a visiting fellow in the Department of Mathematics at the London School of Economics and Political Science. Previously\, he held postdoctoral positions at TU Wien Informatics and in the Université libre de Bruxelles Department of Computer Science. Bhore received his PhD from the Stein Faculty of Computer and Information Science at Ben-Gurion University of the Negev. He has received a Kreitman Foundation Fellowship\, a U.S.-Israel Binational Science Foundation fellowship\, a London Mathematical Society Fellowship\, and a Young Faculty Award and Krithi Ramamritham Award for Creative Research at IIT Bombay. Bhore’s research interests include computational geometry\, algorithms\, combinatorial optimization\, and algorithmic aspects of machine learning. \nZoom link »
URL:https://www.cs.jhu.edu/event/cs-seminar-series-sketching-and-uncertainty-through-the-geometric-lens/
LOCATION:107 Malone Hall
CATEGORIES:Seminars and Lectures
END:VEVENT
END:VCALENDAR