Powers of Tensors and Fast Matrix Multiplication

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


Duration: 48:35
1,835 views
19

Francois Le Gall, University of Tokyo
Tensors in Computer Science and Geometry
http://simons.berkeley.edu/talks/francois-le-gall-2014-11-12



Other Videos By Simons Institute for the Theory of Computing


2014-11-14Learning Mixture of Gaussians using Moment Tensor
2014-11-14Orthogonal Tensor Decomposition
2014-11-14Towards a Complete Classification of Multipartite Entanglement
2014-11-14Cactus Varieties of Cubic Forms: Apolar Local Artinian Gorenstein Rings
2014-11-14Progress on Strassen's Conjecture
2014-11-14Approaches to Bounding the Exponent of Matrix Multiplication
2014-11-14Entanglement Polytopes
2014-11-14Characters of Equivariant D-modules on Veronese Cones
2014-11-14Tensor Decomposition, Sparse Representations and Applications
2014-11-14The Geometry of the Identifiability of Tensors
2014-11-14Powers of Tensors and Fast Matrix Multiplication
2014-11-14Uniqueness of Tensor Decomposition and Identifiability in Mixture Models
2014-11-04An Efficient Parallel Solver for SDD Linear Systems
2014-11-04Graph Based Processing of Big Images
2014-11-03Autocatalytic Sets and Models of Early Life
2014-11-03Some Applications in Human Behavior Modeling
2014-11-03Comparing the Theory and Practice of Spectral Algorithms to Combinatorial Flow Algorithms for ...
2014-11-03Spectral Approaches to Nearest Neighbor Search
2014-11-03Learning Functions and Sets with Spectral Regularization
2014-11-03Graph Matching: Relax or Not?
2014-11-03Connection Laplacian, Hodge Laplacian, and Tensor Laplacian of a Graph


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithms and Complexity in Algebraic Geometry
Francois Le Gall