BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Events - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Events
X-ORIGINAL-URL:https://events.ucsc.edu
X-WR-CALDESC:Events for Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250721T193000
DTEND;TZID=America/Los_Angeles:20250721T193000
DTSTAMP:20260407T101015
CREATED:20250716T070000Z
LAST-MODIFIED:20250925T231317Z
UID:10000070-1753126200-1753126200@events.ucsc.edu
SUMMARY:Astronomy on Tap!
DESCRIPTION:Abbott Square Market. 118 Cooper St\, Santa Cruz\, CA 95060 \nMonday July 21\, 7:30 pm \nNo Bad Questions: Exoplanets Edition \nAsk our panelists your wildest questions!  \nFree and open to people of all ages!
URL:https://events.ucsc.edu/event/astronomy-on-tap-6737/
LOCATION:Abbott Square
GEO:36.9747144;-122.0259958
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250722T120000
DTEND;TZID=America/Los_Angeles:20250722T120000
DTSTAMP:20260407T101015
CREATED:20250703T070000Z
LAST-MODIFIED:20250925T231316Z
UID:10000059-1753185600-1753185600@events.ucsc.edu
SUMMARY:ALEKS Math Placement for Science and Math Majors
DESCRIPTION:Get introduced to ALEKS PPL\, an essential online platform for assessing and strengthening your math skills. In this brief session\, you’ll learn how ALEKS functions as both a placement assessment and a personalized learning tool. Discover how it can support your academic success in first-year science coursework like chemistry and calculus. For a Zoom link\, please register here.
URL:https://events.ucsc.edu/event/aleks-math-placement-for-science-and-math-majors/
CATEGORIES:Lectures & Presentations,Meetings & Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250725T110000
DTEND;TZID=America/Los_Angeles:20250725T110000
DTSTAMP:20260407T101015
CREATED:20250709T070000Z
LAST-MODIFIED:20250925T231317Z
UID:10000065-1753441200-1753441200@events.ucsc.edu
SUMMARY:Basu\, S. (CSE) - Decomposition Techniques for Web-Scale Networks: Bridging Theory and Practice
DESCRIPTION:Decompositions of large-scale networks are central to many applications in graph mining\, network science\, and algorithm design. Over several decades\, a rich body of work has developed techniques to partition networks with various different objectives. However\, a noticeable gap persists between methods with strong theoretical guarantees\, and those that perform well in practice. Practical algorithms often lack provable guarantees\, while theoretically sound methods are rarely straightforward to implement\, and scale poorly. This thesis presents a suite of techniques that aim to close this gap\, presenting decomposition methods that are both theoretically grounded and practically efficient. \n\nThe first part of the thesis focuses on dense subgraph decomposition\, a fundamental problem with numerous real-world applications and a close relation to the problem of community detection studied in the complex networks literature. Specifically\, we focus on decompositions that produce a large number of small components; a variant that existing techniques struggle with. We propose a novel shift in perspective: rather than approximate the optimum closely using traditional optimization approaches\, we develop fast algorithms with provable lower bounds on output quality. We introduce some new objectives and metrics to achieve these\, and introduce a new theoretical framework that captures structural properties of real-world networks. We compare our perspective with the common approach taken in the community detection literature\, and demonstrate algorithms that significantly outperform prior methods across a broad range of datasets. \nThe second part of the thesis explores how network decompositions can enable sublinear-time algorithms: ones that produce approximate solutions without needing to inspect the entire input. We study two somewhat distinct problems. The first is a property testing problem in bounded-degree planar graphs\, where we show that hyperfinite decompositions allow for efficient testing of even the most complex properties. The second examines shortest-path computation in real-world networks. By observing that shortest paths often traverse a dense core\, we design the first sublinear algorithm that exploits this structure to approximate shortest paths. Our method competes with exact algorithms in speed\, while scaling to larger networks that such algorithms cannot handle. \nWe leave some open problems and discuss ongoing and future work\, and provide pointers on how our insights can be leveraged to study a larger class of problems in graph algorithms. \nEvent Host: Sabyasachi Basu\, PhD Candidate\, Computer Science & Engineering \nAdvisor: C. Seshadhri
URL:https://events.ucsc.edu/event/basu-s-cse-decomposition-techniques-for-web-scale-networks-bridging-theory-and-practice/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
GEO:37.0009723;-122.0632371
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Engineering 2 Engineering 2 1156 High Street Santa Cruz CA 95064;X-APPLE-RADIUS=500;X-TITLE=Engineering 2 1156 High Street:geo:-122.0632371,37.0009723
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250725T183000
DTEND;TZID=America/Los_Angeles:20250725T183000
DTSTAMP:20260407T101015
CREATED:20250702T070000Z
LAST-MODIFIED:20250925T231621Z
UID:10000056-1753468200-1753468200@events.ucsc.edu
SUMMARY:The Curiosity Gala
DESCRIPTION:Join us for The Curiosity Gala on July 25\, 2025\, as we celebrate the 45th Annual Dickens Universe Conference! \nNow open to the public\, this enchanting evening invites community members to don their finest Victorian attire and enjoy a night of lively entertainment—including Victorian dance lessons\, casino tables\, a raffle\, postprandial potations\, and a live auction! \nHosted by the Dickens Project\, the Dickens Universe is a unique cultural event that brings together scholars\, teachers\, students\, and members of the general public for a week of stimulating discussion and festive social activity on the beautiful Santa Cruz campus of the University of California—all focused on one or two Victorian novels\, with this year’s novel being Charels Dickens’s The Old Curiosity Shop. \nThe week-long conference culminates in The Curiosity Gala—a festive celebration that brings together conference attendees and community members. Purchases from the evening’s activities will support the Dickens Project’s educational programs. \nTickets are $50 benefiting the Dickens Project's educational programs.
URL:https://events.ucsc.edu/event/the-curiosity-gala/
END:VEVENT
END:VCALENDAR