Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation
Explore efficient algorithms for positive semidefinite low-rank approximation, focusing on robustness and sample optimality in matrix computations.
Deterministic Min-cut in Poly-logarithmic Max-flows
Explore cutting-edge algorithms for efficiently solving network flow problems, focusing on deterministic min-cut techniques and their relationship to max-flow computations.
On the Existence of Algebraically Natural Proofs
Explore the concept of algebraically natural proofs in mathematics, examining their existence and implications for computational complexity theory.
The Complexity of Approximating Averages on Bounded-Degree Graphs
Explore the intricacies of approximating averages on bounded-degree graphs, delving into computational complexities and algorithmic approaches.
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems
Explore multi-pass graph streaming lower bounds for cycle counting, MAX-CUT, matching size, and related problems in this advanced computer science presentation.
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms
Explore near-quadratic lower bounds for two-pass graph streaming algorithms, covering streaming models, graph problems, and Ruzsa-Szemeredi graphs.
Dynamic PageRank: Additive Error and Batch Recomputation
Explores dynamic PageRank algorithms, proving hardness of relative error approximations and demonstrating efficiency of batch recomputation for L1 error metric in dynamic graph settings.
Decremental Shortest Paths Against an Adaptive Adversary
Explore efficient algorithms for maintaining shortest paths in dynamic graphs undergoing deletions, with a focus on near-optimal deterministic data structures and adaptive adversary scenarios.
Mathematics for Game Engine Development
Explore essential mathematics for game engine development, covering GLM integration and implementation for robust 3D graphics and physics calculations.
Solving the Hardest Problems in Mathematics - Interview with Daniel Spielman
Mathematician Tom Crawford interviews Daniel Spielman about his career, the Nevanlinna Prize, and contributions to mathematical aspects of information sciences, offering insights into solving complex problems.
Distributed Graph Techniques in the MPC Model
Explore advanced distributed graph algorithms in the Massively Parallel Computation model, focusing on efficiency and scalability for large-scale data processing.
Inverse Problems on Graphs with Geometric Deep Learning
Explores geometric deep learning for graph inverse problems, focusing on non-Euclidean geometries, physics-based approaches, and applications in particle physics and community detection.
Minimum Isolating Cuts - A New Tool for Solving Minimum Cut Problems
Explore a powerful new tool for solving minimum cut problems in combinatorial optimization, with applications to global, Steiner, and all-pairs min-cut algorithms.
On Dynamic Graph Approximations - The Case of J-Trees
Explores dynamic maintenance of j-trees in graph theory, discussing implications for cut-based optimization, maximum flows, and minimum cost-flow computations in algorithmic design.
On Engineering Dynamic Graph Algorithms
Explore challenges, techniques, and best practices for engineering dynamic graph algorithms, with insights on experimental approaches and design considerations.
Matrix Multiplication - C Programming
Learn to implement matrix multiplication in C, covering algorithm design, memory allocation, and efficient coding techniques for handling multi-dimensional arrays.
Graph and Tensor Algorithmic Complexity - Unit 6, Module 5
Explore algorithmic complexity in graphs and tensors, focusing on computational approaches to causality and living systems from networks to cells.
Bayesian Inference by Program Verification - Joost-Pieter Katoen, RWTH Aachen University
Explore Bayesian inference through program verification, learning how weakest precondition reasoning can be applied to exact inference and analyzing expected sampling times in Bayesian networks.
Concentration of Tempered Posteriors and of Their Variational Approximations – Pierre Alquier
Explores concentration of tempered posteriors and variational approximations in high-dimensional function reconstruction, addressing challenges in approximation theory and non-parametric regression.
In-Database Factorised Learning - Professor Dan Olteanu
Explore in-database factorised learning techniques for efficient data analysis and machine learning, covering integration approaches, advantages, and practical applications in relational databases.
Algorithmic Fairness and Individual Probabilities
Explore algorithmic fairness and the concept of individual probabilities, examining their implications for AI ethics and decision-making processes in machine learning applications.