Playlist: 19 videos Workshops

Fast Algorithms via Spectral Methods

Dec. 1 – Dec. 5, 2014

This workshop aims to bring together researchers interested in the various mathematical and algorithmic tools that underlie dramatic recent developments in fast algorithms for diagonally dominant linear systems and their...

0:58:26

Characterization of Cutoff for Reversible Markov Chains, and Surprise Probabilities

Yuval Peres, Microsoft Research Redmond
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/yuval-peres-2014-12-03
Visit talk page
1:3:21

Faster Spectral Algorithms via Approximation Theory

Nisheeth Vishnoi, École Polytechnique Fédérale de Lausanne
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/nisheeth-vishnoi-2014-12-03
Visit talk page
0:48:30

Generalized Cheeger Inequalities and Constrained Clustering

Ioannis Koutis, University of Puerto Rico
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/ioannis-koutis-2014-12-03
Visit talk page
0:55:54

Solving $1$-Laplacians of Convex Simplicial Complexes

Gary Miller, Carnegie Mellon University
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/gary-miller-2014-12-04
Visit talk page
1:5:22

First-Order Optimization and Online Learning Techniques in the Design of Fast Spectral Algorithms

Lorenzo Orecchia, Massachusetts Institute of Technology and Boston U
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/lorenzo-orecchia-2014-12-04
Visit talk page
0:44:51

A Faster Algorithm for Linear Programming and the Maximum Flow Problem I

Yin Tat Lee, Massachusetts Institute of Technology
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/yin-tat-lee-2014-12-04
Visit talk page
1:1:8

A Faster Algorithm for Linear Programming and the Maximum Flow Problem II

Aaron Sidford, Massachusetts Institute of Technology
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/aaron-sidford-2014-12-04
Visit talk page
0:59:3

Fast Flow Algorithms via Cut-Approximators

Jonah Sherman, UC Berkeley
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/jonah-sherman-2014-12-05
Visit talk page
0:41:32

Cut-Approximators, Approximating Undirected Max Flows, and Recursion

Richard Peng, Massachusetts Institute of Technology
Fast Algorithms via Spectral Methods
http://simons.berkeley.edu/talks/richard-peng-2014-12-05
Visit talk page