Videos

Start date cannot be after end date.

Does Neuroscience Need Mathematics? And vice-versa?

Presenter
  • David Terman
April 5, 2010
MBI
Capturing the Macroscopic Behavior of Complex Systems Using Multiscale Methods Thumbnail

Capturing the Macroscopic Behavior of Complex Systems Using Multiscale Methods

November 2, 2008
IMA
Design, Analysis, and Modeling of Protein-DNA Loops Thumbnail

Design, Analysis, and Modeling of Protein-DNA Loops

Presenter
  • Jason Kahn
September 20, 2007
IMA
Stefan Wippermann - Capturing Electrode Potential Dynamics in Ab initio Electrochemical Simulations Thumbnail

Stefan Wippermann - Capturing Electrode Potential Dynamics in Ab initio Electrochemical Simulations

Presenter
  • Stefan Wippermann
October 28, 2025
IPAM
Mark Tuckerman - Beating viscosity-conductivity inverse relation to create electrolyte for battery Thumbnail

Mark Tuckerman - Beating viscosity-conductivity inverse relation to create electrolyte for battery

Presenter
  • Mark Tuckerman
October 28, 2025
IPAM
Nisha Chandramoorthy - Toward physical generative modeling - IPAM at UCLA Thumbnail

Nisha Chandramoorthy - Toward physical generative modeling - IPAM at UCLA

Presenter
  • Nisha Chandramoorthy
July 16, 2025
IPAM
Alex Cloninger - Linearized Optimal Transport to Predict Evolution of Stochastic Particle Systems Thumbnail

Alex Cloninger - Linearized Optimal Transport to Predict Evolution of Stochastic Particle Systems

Presenter
  • Alex Cloninger
July 15, 2025
IPAM
Toward physical generative modeling Thumbnail

Toward physical generative modeling

Presenter
  • Nisha Chandramoorthy
June 12, 2025
IMSI
Online Tensor Inference Thumbnail

Online Tensor Inference

Presenter
  • Will Wei
May 7, 2025
IMSI
Luis Ferroni - The polytope of all matroids - IPAM at UCLA Thumbnail

Luis Ferroni - The polytope of all matroids - IPAM at UCLA

Presenter
  • Luis Ferroni
February 12, 2025
IPAM
When and How are (promise) Constraint Satisfaction Problems Efficiently Solvable? Thumbnail

When and How are (promise) Constraint Satisfaction Problems Efficiently Solvable?

Presenter
  • Venkatesan Guruswami
October 21, 2024
IAS
Algorithms, Approximation, and Learning in Market and Mechanism Design: "Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals / Residents Problem with Couples" Thumbnail

Algorithms, Approximation, and Learning in Market and Mechanism Design: "Couples can be Tractable: New Algorithms and Hardness Results for the Hospitals / Residents Problem with Couples"

Presenter
  • David Manlove
November 6, 2023
SLMath