BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Events - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260427T104000
DTEND;TZID=America/Los_Angeles:20260427T114500
DTSTAMP:20260425T041646
CREATED:20260423T164929Z
LAST-MODIFIED:20260423T164929Z
UID:10013984-1777286400-1777290300@events.ucsc.edu
SUMMARY:ECE 290 Seminar: Speaker Luat T. Vuong - Biospeculative approaches to the “needle in a haystack”: vortex encoders and hybrid optical neural-networks
DESCRIPTION:Presenter: Luat Vuong\, Associate Professor in Mechanical Engineering\, UC Riverside \nDescription: Given the growing computational demands of machine learning\, how can we scale approaches for sifting through large volumes of data—including patterned or delayed information embedded as “noise”? Many computer vision applications have a strict power budget and demand robust\, rapid-response\, and even real-time image processing. In this talk\, I’ll describe our “biospeculative” approaches to efficiently offload traditional computer vision tasks to diffractive optics. Such hybrid approaches leverage the benefits of preprocessing optics and shallow electronic algorithms. With optics\, we spatially encode multiple dimensions of light (color\, polarization) and decode with simple\, back-end neural networks. I will focus the discussion on the role of encoding from vortex optical singularities. With vortex and multi-vortex encoders\, we identify sparse and reconstruct low-signal features\, tracking the “needle in a haystack”. \nBio: Luat Vuong is currently Associate Professor in Mechanical Engineering at UC Riverside\, with cooperating faculty memberships in Physics\, Electrical and Computer\, and Materials Science and Engineering. She is also affiliate faculty in Robotics and at the Center for Environmental Research and Technology. She is trained as an optical applied physicist\, received her undergrad at UC Berkeley\, PhD at Cornell University. She is a recipient of the 2007 Fulbright Fellowship (which she took at the Technical University of Delft in The Netherlands)\, 2010 European Council MC-IIF Global Postdoctoral Fellowship (which she took at the Institute of Photonic Sciences in Spain)\, 2012 NSF Career Award\, a 2016 J-FRASE\, Sloan- funded Award\, the 2019 DARPA Young Faculty Award\, and the 2021 DARPA Director’s Fellowship. Her research is broadly at the intersection of optics\, nonlinear dynamics\, and data science. \nHosted by: Professor Soumya Bose\, ECE Department \nZoom Link: https://ucsc.zoom.us/j/97975378707?pwd=ljcgaCfhMmhZ88Vt5dqQUBVQRjehOx.1
URL:https://events.ucsc.edu/event/ece-290-seminar-speaker-luat-t-vuong-biospeculative-approaches-to-the-needle-in-a-haystack-vortex-encoders-and-hybrid-optical-neural-networks/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations,Seminars
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2026/04/Luat-Vuong-ME250.jpg
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:20260427T110000
DTEND;TZID=America/Los_Angeles:20260427T130000
DTSTAMP:20260425T041646
CREATED:20260420T225301Z
LAST-MODIFIED:20260423T210320Z
UID:10012119-1777287600-1777294800@events.ucsc.edu
SUMMARY:Quality First Coding Contest
DESCRIPTION:This is a programming contest\, but with a twist! Instead of scoring you based on your speed and solution accuracy\, we score you based on your programming quality and solution accuracy. This means that instead of looking at how fast you can program a solution\, we look at your number of compiles/runs instead.* The contestant that uses the least number of compiles/runs to produce passing code is the winner. Ties are broken by time. \nFood will be provided. QFCC 20260427 – Poster
URL:https://events.ucsc.edu/event/quality-first-coding-contest/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/04/Quality-First-Coding-Contest.png
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:20260429T110000
DTEND;TZID=America/Los_Angeles:20260429T121500
DTSTAMP:20260425T041646
CREATED:20260402T185047Z
LAST-MODIFIED:20260402T185047Z
UID:10011848-1777460400-1777464900@events.ucsc.edu
SUMMARY:CSE Colloquium - Towards Safe and Resilient Large-scale Distributed Programming
DESCRIPTION:Presenter: Philipp Haller\, KTH Royal Institute of Technology \nAbstract: \nDistributed programming is notoriously difficult. Not only are distributed systems concurrent\, they pose additional challenges including data consistency and fault tolerance. At the same time\, the share of software systems that are necessarily distributed systems is growing rapidly. As a result\, too many software developers are asked to become distributed systems experts. Thus\, tools and techniques for ensuring the correctness of distributed systems are urgently needed in order to leave this unsustainable trajectory. This talk presents research results towards the design and implementation of programming systems that support emerging applications and workloads; provide reliability and trust; and embrace simplicity and accessibility. Concretely\, the presented work focuses on two directions. \nThe first direction explores a distributed programming model that provides consistency while enabling high availability for workloads operating on join-semilattices without sacrificing partition tolerance. We propose a new consistency protocol\, called observable atomic consistency protocol (OACP)\, which leverages on-demand coordination to support both coordination-free operations as well as totally-ordered operations on replicated data types. We present a formal\, mechanized model of OACP in rewriting logic and verify key correctness properties using the model checking tool Maude. Furthermore\, we present the evaluation of a prototype implementation of OACP based on Akka\, a widely-used actor-based middleware. The second direction explores a programming system that aims to reconcile the scalability and fault tolerance of stream processing systems with the flexibility of the actor concurrency model. The programming system ensures a failure-transparency property\, effectively masking failures through transparent recovery. Our work is the first to formalize failure transparency using a small-step operational semantics\, and to provide proofs of failure transparency for stateful dataflow streaming and a fault-tolerant actor-based programming model. \nBio: \nPhilipp Haller is an Associate Professor in the School of Electrical Engineering and Computer Science (EECS) at KTH Royal Institute of Technology in Stockholm\, Sweden. His main research interests are in the design and implementation of programming languages\, type systems\, concurrency\, and distributed programming. He was part of the team that received the 2019 ACM SIGPLAN Programming Languages Software Award for the development of the Scala programming language. Prior to KTH\, he was an early employee at Akka (previously Lightbend\, Inc.)\, a start-up company developing and supporting Scala as well as frameworks for large-scale distributed programming. Prior to Akka\, he was a post-doctoral fellow at Stanford University\, USA\, and at EPFL\, Switzerland. In 2010 he received his PhD in computer science from EPFL\, including a nomination for the 2010 EPFL Doctorate Award. In 2006 he received his Dipl.-Inform. degree from Karlsruhe Institute of Technology (previously University of Karlsruhe)\, Germany. \nHosted by: Professor Mohsen Lesani \nLocation: Engineering 2\, Room E2-180 (Refreshments such as fruit\, pastries\, coffee\, and tea will be provided.) \nZoom Option: https://ucsc.zoom.us/j/93445911992?pwd=YkJ2TQtF79h0PcNXbEcpZLbpK0coiY.1&jst=3
URL:https://events.ucsc.edu/event/cse-colloquium-towards-safe-and-resilient-large-scale-distributed-programming/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations,Seminars
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/03/BElogoWHITE.png
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:20260504T170000
DTEND;TZID=America/Los_Angeles:20260504T190000
DTSTAMP:20260425T041646
CREATED:20260410T070115Z
LAST-MODIFIED:20260410T070115Z
UID:10012093-1777914000-1777921200@events.ucsc.edu
SUMMARY:Analyzing AI Security and Vulnerabilities in the Current Landscape
DESCRIPTION:Interested in careers in AI and cybersecurity? Then don’t miss this highly informative workshop covering today’s most relevant trends in this space. \n  \nIn this 2-part session\, you’ll get expert insight from security leaders at Microsoft. Here’s a breakdown of each part: \n  \nWhen AI Breaks\, Be the One Who Notices\nSpeaker: Raji Vanninathan \nDiscover how AI Security and AI Safety vulnerability research can lead to real‑world impact\, public credit\, and a competitive edge in the current job market. This talk focuses on how students can understand what qualifies as a real AI vulnerability\, how meaningful findings are assessed and validated\, and how responsible disclosure\, CVEs\, and bug bounty programs translate research into recognized impact across the industry We will also explore emerging challenges facing bounty programs as AI-assisted discoveries drivers higher volume and how the signal‑to‑noise problem of “AI slop” is reshaping vulnerability triage and detection. \nReimagining Security for the Agentic AI \nSpeaker: Neta Haiby \nAs AI evolves from tools into autonomous agents that can plan\, act\, and collaborate\, traditional security models start to break down. This session explores how agentic AI changes the rules of trust\, access\, and accountability – introducing challenges like agent sprawl\, permission misuse\, and unintended actions across systems.\nBuilding on foundational AI security concepts\, we’ll dive into practical strategies for securing and governing AI agents covering identity\, access control\, monitoring\, and human oversight. Students will leave with a clear mental model for securing agent-based systems and the skills to think critically about the next generation of AI security architectures. \n  \nDon’t miss this highly relevant and compelling event! And be sure to register as space is limited! \n  \n  \nIf you have disability-related needs\, please contact the Career Success office at csuccess@ucsc.edu or (831) 459-4420 as soon as possible. \n  \nYOU BELONG HERE\nPrograms and services are open to all\, consistent with state and federal law\, as well as the University of California’s nondiscrimination policies. Every initiative—whether a student service\, faculty program\, or community event—is designed to be accessible\, inclusive\, and respectful of all identities. To learn more\, please visit UC Nondiscrimination Statement or Nondiscrimination Policy for UC Publications.
URL:https://events.ucsc.edu/event/analyzing-ai-security-and-vulnerabilities-in-the-current-landscape/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Undergraduate
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:20260511T080000
DTEND;TZID=America/Los_Angeles:20260511T100000
DTSTAMP:20260425T041646
CREATED:20260415T202034Z
LAST-MODIFIED:20260415T202226Z
UID:10012148-1778486400-1778493600@events.ucsc.edu
SUMMARY:Johns\, M. (CMPM) - Playing Together in a Co-Designed Future: Building Resilience Through Community-Centered Gameful Design
DESCRIPTION:Complex societal problems (e.g. wicked problems) such as those brought on by climate change can be addressed through a combination of Research through Design (RtD)\, co-design\, and Serious Games (SG) by inviting affected communities to take part in developing iterative\, experimental solutions and exploring their potential impact. In the course of my research\, I have proposed a framework for design research that engages with wicked problems at the community level through gameful design\, which is based on existing literature in HCI drawing from RtD\, co-design\, and SG. Core elements of the framework include supporting diverse perspectives\, interdisciplinarity\, working with local knowledge\, and aligning different concepts with specific gameful elements to support meaningful interactions and discussion. \nIn a specific case study\, my proposed framework is applied to create a gameful intervention to support wildfire resilience in communities at the Wildland-Urban Interface (WUI) which face particular risks from natural hazards. Through a community co-design process\, open discussions have identified consistent pain-points and challenges faced by communities who have experienced wildfires or evacuations\, e.g. traffic congestion in areas with one road in and out\, while also pinpointing differences in their approaches based on local conditions\, such as whether or not to encourage people to evacuate on foot. Through an RtD approach\, important ideas have emerged about how serious games can be utilized in this space. For example\, a common approach to serious game design is to align the win condition of a game with specific learning outcomes or desired changes. However\, when working with wicked problems there are often complex social dilemmas and conflicting values without clear right answers. In these cases there is a need to map dilemmas and trade-offs to game mechanics rather than mapping learning outcomes to win conditions. \nThe gameful intervention developed through this dissertation integrates local knowledge from communities alongside expert knowledge from disciplines including fire science\, social science\, engineering\, and design. The resulting artifact leverages a minigame design to map different concepts to specific and approachable game mechanics. Through universal and inclusive design practices\, the games can be accessible to a broad audience including both children and older adults. The cooperative multiplayer aspects of the games encourage discussion and collaborative play between friends\, community members\, and particularly intergenerational play within families. In addition to contributing RtD reflections as a result of the project\, I also measured change in resilience at the individual and community levels after deployment of the games through qualitative and quantitative methods. This dissertation contributes to knowledge about what game design has to offer to addressing wicked problems\, with specific approaches to better serve communities facing complex risks such as those associated with a rapidly changing climate. \nEvent Host: MJ Johns\, Ph.D. Candidate\, Computational Media  \nAdvisor: Katherine Isbister \nZoom: https://ucsc.zoom.us/j/7959349044?pwd=cVYraU9yMUVwVFhYWHp6T05OZm5rZz09
URL:https://events.ucsc.edu/event/johns-m-cmpm-playing-together-in-a-co-designed-future-building-resilience-through-community-centered-gameful-design/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option-3.png
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:20260512T100000
DTEND;TZID=America/Los_Angeles:20260512T120000
DTSTAMP:20260425T041646
CREATED:20260421T160759Z
LAST-MODIFIED:20260421T160759Z
UID:10013625-1778580000-1778587200@events.ucsc.edu
SUMMARY:Chen\, Q. (CSE) - New Approximation and Online Algorithms using Novel Combinatorial Structures
DESCRIPTION:Most optimization problems face the challenge of computing an optimum solution requiring superpolynomial time. In particular\, they are classified as NP-hard problems that have no polynomial-time algorithm to date. Instead\, computer scientists turn to find an approximate solution and create numerous elegant algorithms. However\, in the modern era\, computational environments have changed drastically\, and we are not able to afford to design new algorithms for each new problem via repeated trial and error. Therefore\, systematic ways to understand the possibilities and limitations of these problems are desired. This dissertation studies several central combinatorial optimization problems\, focusing on understanding the key structural obstacles and developing unified frameworks. Mainly\, we study two types of combinatorial optimization problems:\n(1) Scheduling. The problem is associated with limited resources\, and our target is to find an allocation method to complete all jobs over time that minimizes the overall budget cost.\n(2) Network Design. Different from scheduling problems. In this problem\, we aim to find a minimum-cost topological network that supports routing for demanding communications. \nOur first work is focused on a group-to-group survivable network design problem that generalizes the classic point-to-point network to support routing between any pair of subsets of nodes. Previous research stops at limited faults\, and the difficulty comes from the way to compress the graph into a tree. We propose a new framework via capacitated tree embeddings against arbitrary faults in the network\, which gives the first polylogarithmic approximation algorithm. Further\, this framework captures nearly all the recent models proposed in the area. \nIn contrast to the offline optimization problems mentioned above\, online algorithms are natural adaptations that have been found in tremendous real applications. In online algorithms\, the algorithm wants to compete against arbitrary uncertainty\, which means the instance is unknown at first and revealed over time. We study various scheduling problems and focus on some important metrics – average flow time\, which measures the average time a job stays in the system from its arrival to completion. Real-world demands give online scheduling problems enormously different settings. Computer scientists need to repeat errors and trials to find a provably good solution. We find the key required combinatorial property is supermodularity for the residual objective\, which measures the average completion time for all alive jobs assuming they have the same arrival time. Further\, we relate supermodularity with gross-substitute/linear-substitute (GS/LS)\, which is a well-studied definition in economics. Finally\, we propose a meta-algorithm that solves all captured problems in one shot. In the end\, we revisit the proportional fairness (PF) algorithm for $L_p$-norms of flow time. By reinterpreting the previous potential function and the corresponding Fisher market\, we show that PF is competitive. \n  \nEvent Host: Qingyun Chen\, Ph.D. Candidate\, Computer Science & Engineering  \nAdvisor: Sungjin Im \nZoom: https://ucsc.zoom.us/j/92628493495?pwd=iJq8YwarrYyofPLF4AmZpwzsZnLyvt.1 \n 
URL:https://events.ucsc.edu/event/chen-q-cse-new-approximation-and-online-algorithms-using-novel-combinatorial-structures-2/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Ph.D. Presentations
ATTACH;FMTTYPE=image/jpeg:https://events.ucsc.edu/wp-content/uploads/2026/04/ph.d.-presentation-graphic-option2.jpg
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:20260513T110000
DTEND;TZID=America/Los_Angeles:20260513T121500
DTSTAMP:20260425T041646
CREATED:20260330T203158Z
LAST-MODIFIED:20260330T203417Z
UID:10011814-1778670000-1778674500@events.ucsc.edu
SUMMARY:CSE Colloquium - The EU’s Cybersecurity Framework: what it is\, what it means
DESCRIPTION:Presenter: Chris Jay Hoofnagle\, Frederik Zuiderveen Borgesius\, Lothar Determann\, Pieter T.J. Wolters \nAbstract: \nThe European Union has enacted a comprehensive cybersecurity framework (the “Framework”) that imposes far-reaching obligations on developers of standalone software and connected products. This Article describes the European legislative approach before turning to a description of the Framework. Anchored by the Cyber Resilience Act and the Cybersecurity Act\, and reinforced by a constellation of sector-specific measures\, the Framework effectively creates a California-like-products-liability regime for software. It mandates extensive security-by-design obligations\, imposes stringent conformity assessment and incident-reporting duties\, and shifts substantial compliance burdens onto manufacturers\, importers\, and distributors. It even treats emotional wrongs caused by software as injurious. The Framework will take full effect in December 2027\, meaning that companies must integrate its requirements into their current product cycles. \nBio: Chris Hoofnagle is professor of law in residence at the University of California\, Berkeley\, where he teaches tort law and cybersecurity. \nHosted by: Professor Alvaro Cardenas \nLocation: Engineering 2\, Room E2-180 (Refreshments such as fruit\, pastries\, coffee\, and tea will be provided.) \nZoom Option: https://ucsc.zoom.us/j/93445911992?pwd=YkJ2TQtF79h0PcNXbEcpZLbpK0coiY.1&jst=3
URL:https://events.ucsc.edu/event/cse-colloquium-the-eus-cybersecurity-framework-what-it-is-what-it-means/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations,Seminars
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/03/BElogoWHITE.png
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:20260527T110000
DTEND;TZID=America/Los_Angeles:20260527T123000
DTSTAMP:20260425T041646
CREATED:20260330T203942Z
LAST-MODIFIED:20260330T203942Z
UID:10011815-1779879600-1779885000@events.ucsc.edu
SUMMARY:CSE Colloquium - Learning to Image: Computational Microscopy for Dynamic Systems
DESCRIPTION:Presenter: Laura Waller\, UC Berkeley \nAbstract: \nComputational imaging jointly designs hardware and algorithms to push beyond the classical limits of imaging\, enabling measurement of new quantities (e.g. 3D\, phase\, and super-resolution) with simple\, inexpensive hardware. These approaches have already transformed consumer photography; our goal is to achieve a similar transformation in scientific microscopy. \nIn this talk\, I will show how end-to-end learning is reshaping the design of imaging systems\, from programmable illumination with LED arrays to compact\, lensless cameras built from Scotch tape. By combining physical models with neural networks\, we can jointly learn how to capture data\, reconstruct images\, and self-calibrate systems that would otherwise be too complex to model. However\, many computational methods rely on multiple measurements\, limiting their use for live\, dynamic samples. I will introduce new space-time algorithms based on implicit neural representations (INRs) that jointly recover structure and motion\, correct artifacts\, and enable high-resolution imaging in regimes where traditional approaches fail. \nBio: \nLaura Waller is the Charles A. Desoer Professor of Electrical Engineering and Computer Sciences at UC Berkeley. She received B.S.\, M.Eng. and Ph.D. degrees from the Massachusetts Institute of Technology in 2004\, 2005 and 2010. After that\, she was a Postdoctoral Researcher and Lecturer of Physics at Princeton University from 2010-2012. She is a Packard Fellow for Science & Engineering\, Moore Foundation Data-driven Investigator\, OSA Fellow\, and Chan-Zuckerberg Biohub Investigator. She has received the Carol D. Soc Distinguished Graduate Mentoring Award\, OSA Adolph Lomb Medal\, the SPIE Early Career Award and the Max Planck-Humboldt Medal. \nHosted by: Professor Alvaro Cardenas \nLocation: Engineering 2\, Room E2-180 (Refreshments such as fruit\, pastries\, coffee\, and tea will be provided.) \nZoom Option: https://ucsc.zoom.us/j/93445911992?pwd=YkJ2TQtF79h0PcNXbEcpZLbpK0coiY.1&jst=3
URL:https://events.ucsc.edu/event/cse-colloquium-learning-to-image-computational-microscopy-for-dynamic-systems/
LOCATION:Engineering 2\, Engineering 2 1156 High Street\, Santa Cruz\, CA\, 95064
CATEGORIES:Lectures & Presentations,Seminars
ATTACH;FMTTYPE=image/png:https://events.ucsc.edu/wp-content/uploads/2026/03/BElogoWHITE.png
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
END:VCALENDAR