On Unifying Asymptotic Complexity with Real-world Performance in Matrix-based Network Computations

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


Duration: 26:17
446 views
3

David Gleich, Purdue University
Unifying Theory and Experiment for Large-Scale Networks http://simons.berkeley.edu/talks/david-gleich-2013-11-21



Other Videos By Simons Institute for the Theory of Computing


2013-12-12Threshold, Influence, Noise, and Discrete Harmonic Analysis
2013-11-30The Emergence of Convention: An Experimental Study of Social Order
2013-11-30Overview: Scalability/Practical Challenges
2013-11-30Overview: Networks Over Time
2013-11-30Overview: Label Prediction/Diffusion
2013-11-30Overview: Causality/Experiments
2013-11-30Overview: Clustering
2013-11-30Overview: Graph Models
2013-11-30Theoretical and Practical Challenges of Recommending Content to Users in a Social Network
2013-11-30Evolving Graphs
2013-11-30On Unifying Asymptotic Complexity with Real-world Performance in Matrix-based Network Computations
2013-11-30Graph Algorithms for Modern Data Models
2013-11-30The Trials and Tribulations of Tractably Counting Triangles
2013-11-30Graph Streams and Sketches: What Can and Can't Be Done
2013-11-30Pre-Processing of Dynamic Networks: Its Impact on Analytics
2013-11-30Estimating Time-Varying Networks
2013-11-30The Impact of Network Structure on Relational Learning and Inference
2013-11-30How Predictable are Online Cascades
2013-11-30Semi-supervised Learning on Graphs, Using Observed Correlation Structure
2013-11-30The Effect of Social Media on News Consumption
2013-11-30On Sampling in Dynamic Networks for Inference, Experiments, and Interventions


Tags:
Simons Institute
Big Data
UC Berkeley
computer science
theory of computing
David Gleich