Faster Spectral Algorithms via Approximation Theory

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=WQt04jiXF8A


Duration: 1:03:21
1,040 views
7

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



Other Videos By Simons Institute for the Theory of Computing


2015-01-20Distribution Estimation and Applications II
2015-01-20Coding for Modern Distributed Storage Systems IV
2015-01-20Information Theory in Computational Complexity II
2015-01-20Information Theory in Computational Complexity I
2015-01-20Distribution Estimation and Applications I
2015-01-20Information Theory in Combinatorics I
2015-01-20Information Theory in Computational Complexity III
2015-01-20Distribution Estimation and Applications III
2014-12-10The Unreasonable Effectiveness of Spectral Graph Theory: A Confluence of Algorithms, Geometry & ...
2014-12-08First-Order Optimization and Online Learning Techniques in the Design of Fast Spectral Algorithms
2014-12-08Faster Spectral Algorithms via Approximation Theory
2014-12-08Electrical Flows Primitive and Fast Graph Algorithms
2014-12-08A Faster Algorithm for Linear Programming and the Maximum Flow Problem II
2014-12-08L_p Row Sampling by Lewis Weights
2014-12-08Gaussian Free Fields and Computing the Cover Time
2014-12-08Sketching as a Tool for Numerical Linear Algebra
2014-12-08An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicom...
2014-12-08Characterization of Cutoff for Reversible Markov Chains, and Surprise Probabilities
2014-12-08Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
2014-12-08Solving $1$-Laplacians of Convex Simplicial Complexes
2014-12-08The Sketching Complexity of Graph Cuts


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithmic Spectral Graph Theory
Nisheeth Vishnoi