Graph-Based User Behavior Modeling - Part 1
Auhtors: Alex Beutel, Leman Akoglu, Christos Faloutsos Abstract: How can we model users' preferences? How do anomalies, fraud, and spam effect our models ...
Association for Computing Machinery (ACM)
Low Diameter Graph Decompositions and Approximating Unique Games
Lap-Chi Lau, University of Waterloo https://simons.berkeley.edu/talks/lap-chi-lau-09-14-17 Discrete Optimization via Continuous Relaxation.
Simons Institute
Mohr's Circle (contd…), Stress Invariants, Decomposition of the Stress Tensor
IIT Delhi July 2018
When the FBI had too many fingerprints in storage | The mathematics of image compression
Get free access to over 2500 documentaries on CuriosityStream: http://go.thoughtleaders.io/1621320200106 (use promo code "zachstar" at sign up) STEMerch ...
Zach Star
Lec 13 | MIT 18.086 Mathematical Methods for Engineers II
Elimination with Reordering: Sparse Matrices View the complete course at: http://ocw.mit.edu/18-086S06 License: Creative Commons BY-NC-SA More ...
MIT OpenCourseWare
#93. РЕАЛЬНЫЙ ВАРИАНТ ЕГЭ ПО МАТЕМАТИКЕ ЗА 23 МИНУТЫ!
За 23 минуты разбираем всю вторую часть ЕГЭ по математике профильного уровня. Главное, сначала попытаться решить задачи самостоятельно!
Wild Mathing
Tensor Decompositions for Learning Hidden Variable Models
In many applications, we face the challenge of modeling the interactions between multiple observations. A popular and successful approach in machine learning ...
Microsoft Research
20. Roth's theorem III: polynomial method and arithmetic regularity
MIT 18.217 Graph Theory and Additive Combinatorics, Fall 2019 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/18-217F19 YouTube ...
MIT OpenCourseWare
From Sparse Matrices to Graphs and Back Again
John Gilbert, UC Santa Barbara Parallel and Distributed Algorithms for Inference and Optimization http://simons.berkeley.edu/talks/john-gilbert-2013-10-22.
Simons Institute
From joins to aggregates and optimisation problems: Professor Dan Olteanu, University of Oxford
This is an advanced data science class on recent advances on the foundations of database query processing. The first part details a recent body of work on ...
The Alan Turing Institute
Stanford Lecture: Don Knuth—"A Conjecture That Had To Be True" (2017)
Donald Knuth's 23rd Annual Christmas Tree Lecture: A Conjecture That Had To Be True Speaker: Donald Knuth 2017 A few months ago, the speaker did some ...
stanfordonline
Learning Representations Using Causal Invariance
ECE Seminar Series: Modern Artificial Intelligence Speaker: Leon Bottou, Facebook, AI Research.
NYU Tandon School of Engineering
SuperLU: Sparse Direct Solver and Preconditioner | X. Sherry Li, Lawrence Berkeley National Lab
Slides for this presentation can be viewed here: http://extremecomputingtraining.anl.gov/files/2014/01/fastmath-superlu-atpesc-08-2014.pdf Presented at the ...
ANL Training
Evaggelia Pitoura - Querying Evolving Data Graphs
Graphs form a natural model for expressing relationships and interactions between entities. Most large graphs, including those modeling social and cooperation ...
ISAE-ENSMA officiel
"Algorithm Design for Large-Scale Datasets" (CRCS Lunch Seminar, Charalampos "Babis" Tsourakakis)
Harvard's CRCS
STOC 2020 - Session 1A: TSP
Association for Computing Machinery (ACM)
Mod-04 Lec-28 Boxicity,Sphericity, Hamiltonian circuits
Graph Theory by Dr. L. Sunil Chandran, Department of Computer Science and Automation, IISc Bangalore. For more details on NPTEL visit http://nptel.iitm.ac.in.
nptelhrd
Stanford Seminar - Towards theories of single-trial high dimensional neural data analysis
EE380: Computer Systems Colloquium Seminar Towards theories of single-trial high dimensional neural data analysis Speaker: Surya Ganguli, Stanford, ...
stanfordonline
Tyler Reddy - Computational Geometry in Python - PyCon 2016
Speaker: Tyler Reddy Computational geometry deals with the algorithms used to solve a diverse set of problems in geometry. Applications range from robotics ...
PyCon 2016
Oceans as natural climate solutions? | Paul Falkowski | Global Carbon Management Workshop
Stanford ENERGY
Homology cobordism and triangulations – Ciprian Manolescu – ICM2018
Geometry | Topology Invited Lecture 5.5 | 6.1 Homology cobordism and triangulations Ciprian Manolescu Abstract: The study of triangulations on manifolds is ...
Rio ICM2018
Improving Christofides' Algorithm for the s-t Path TSP
We present a deterministic (1+sqrt(5))/2-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including ...
Microsoft Research
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the ...
Microsoft Research
Mod-01 Lec-25 Ternary Phase Diagram
Principles of Physical Metallurgy by Prof. R.N. Ghosh,Department of Metallurgy and Material Science,IIT Kharagpur.For more details on NPTEL visit ...
nptelhrd
A graph-based formalism for surface codes and twists
Presenter: Ted Yoder, Research Staff Member, IBM Research A rotation system is a combinatorial description of a graph and its embedding in a 2-dimensional ...
IBM Research
Webinar #12: Use and Interpretation of the Seismic CPT
This webinar will discuss the use of the Seismic Cone Penetration Test (sCPT) as well as interpretation of the data. The webinar should last approximately ...
GreggCPTWebinars
Tutorial : 3D Deep Learning
Leonidas Guibas; Michael Bronstein; Evangelos Kalogerakis; Qixing Huang; Jimei Yang;Hao Su;Charles Qi Understanding 3D data has been attracting ...
ComputerVisionFoundation Videos
Can Non-Convex Optimization be Robust?
Rong Ge (Duke University) https://simons.berkeley.edu/talks/can-non-convex-optimization-be-robust Robust and High-Dimensional Statistics.
Simons Institute
Improved Approximation Algorithms for the TSP and S-t-path TSP
David Shmoys, Cornell University https://simons.berkeley.edu/talks/david-shmoys-09-12-17 Discrete Optimization via Continuous Relaxation.
Simons Institute
Graphing a higher degree polynomial
To graph a higher degree polynomial 1. Determine the end behavior 2. find the x-intercepts 3. determine the multiplicity 4. find the y-intercept Graph the ...
Jennifer Laughlin
Lec 43: Axial Compressor: Different factors, Degree of Reaction and Free Vortex Condition
NPTEL IIT Guwahati
JuliaCon 2019 | Polynomial and Moment Optimization in Julia and JuMP
Polynomial and moment optimization problems are infinite dimensional optimization problems that can model a wide range of problems in engineering and ...
The Julia Programming Language
Symmetries in Algebraic Geometry and the Cremona Group
Math Associates Seminar: Symmetries in Algebraic Geometry and the Cremona Group Speaker: Carolina Araujo (IMPA) Abstract: In this talk I will discuss ...
ICTP Mathematics
Time Series data Mining Using the Matrix Profile part 2
Time Series data Mining Using the Matrix Profile: A Unifying View of Motif Discovery, Anomaly Detection, Segmentation, Classification, Clustering and Similarity ...
KDD2017 video
Giuseppe CARLEO - Neural-network quantum states
https://indico.math.cnrs.fr/event/2435/
Institut des Hautes Études Scientifiques (IHÉS)
Feedback Arc Sets and Girth in Digraphs
Given a directed graph G with girth at least m+1 (and no parallel edges), let b(G) denote the size of the smallest subset X of the edges of G so that G \ X has no ...
Microsoft Research
High-Yield Optimization: Streamlining the path to more easily manufacturable designs
The conventional optical design approach results in designs that are very sensitive to manufacturing and alignment errors, which means the optical product is ...
Zemax LLC
Distribution-Free Models of Social and Information Networks
Tim Roughgarden, Stanford University https://simons.berkeley.edu/talks/tim-roughgarden-09-21-2016 Optimization and Decision-Making Under Uncertainty.
Simons Institute
CVPR 2019 Oral Session 3-2A: Deep Learning
0:00 Practical Full Resolution Learned Lossless Image Compression Fabian Mentzer (ETH Zurich)*; Eirikur Agustsson (ETH Zurich); Michael Tschannen (ETH ...
ComputerVisionFoundation Videos
Q&A Livestream
I make short, to-the-point online math tutorials. I struggled with math growing up and have been able to use those experiences to help students improve in math ...
Brian McLogan
Lecture 9 | Introduction to Linear Dynamical Systems
Professor Stephen Boyd, of the Electrical Engineering department at Stanford University, lectures on autonomous linear dynamical systems for the course, ...
Stanford
Testing Correlation of Unlabeled Random Graphs
Jiaming Xu, Duke University Computational Phase Transitions https://simons.berkeley.edu/talks/planted-matching-problem-phase-transitions-and-exact-results.
Simons Institute
