Highly Scalable Branch-and-Bound for Maximum Monomial Agreement

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


Duration: 28:59
118 views
0

Cynthia Phillips, Sandia National Laboratories
Parallel and Distributed Algorithms for Inference and Optimization
http://simons.berkeley.edu/talks/cynthia-phillips-2013-10-23



Other Videos By Simons Institute for the Theory of Computing


2013-11-30Overview: Network Formation
2013-11-30Large-scale Graph Clustering and Message-passing-based Distributed Framework
2013-11-30Local Clustering and the Blessing of Transitivity
2013-11-30Finding Small Structures in Large Datasets
2013-11-30Asymptotic Analysis of Unlabelled Networks
2013-11-30Know Your Epidemic: But How?
2013-11-30Bayesian Models for Graph Data and the Open Problem of Invariance in Networks
2013-11-30Practice is Better than Theory: Using Approximate Counting to Mine Large Graphs
2013-11-30Limiting Behavior in Large Networks
2013-11-06How Hard Is It To Find A Good Solution?
2013-10-29Highly Scalable Branch-and-Bound for Maximum Monomial Agreement
2013-10-28Tall-and-skinny QR Factorizations in MapReduce
2013-10-28Parallel Active Learning
2013-10-28Three Goals in Parallel Graph Computations: High Performance, High Productivity, and Reduced Comm...
2013-10-28First Order Methods for Distributed Network Optimization
2013-10-28Stochastic Optimization for Big Data Machine Learning Problems
2013-10-28Large-Scale Generalized Matching
2013-10-28Consensus-Based Distributed Online Prediction and Optimization
2013-10-28Communication Avoiding Algorithms for Linear Algebra and Beyond
2013-10-28Using Data-Oblivious Algorithms for Private Cloud Storage Access
2013-10-28Parallelism in Linear and Mixed Integer Programming


Tags:
Simons Institute
Big Data
UC Berkeley
computer science
theory of computing
Cynthia Phillips