Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Online Matching in Evolving Environments
Graph Chatbot
Related lectures (28)
Exploration Bias
Explores the concept of exploration bias and its impact on data.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Protein Mass Spectrometry and Proteomics: Randomization Overview
Explores the significance of randomization in protein mass spectrometry and proteomics, highlighting its role in minimizing bias and ensuring research validity.
Spatial Statistics: Significance
Explains the calculation of statistical significance in spatial statistics using permutation and randomization methods.
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Optimizing Join Operations: Challenges and Solutions
Explores optimizing join operations in distributed systems, addressing skewness and introducing the 1-Bucket-Theta algorithm.
Statistical Physics of Clusters
Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.
Experimental Design: Replication, Randomization, Blocking
Delves into experimental design in genomics, emphasizing replication, randomization, and blocking for reducing bias and controlling variation.
Matrix Multiplication and Divide-and-Conquer Techniques
Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.
Algorithms to Live By: Optimal Stopping and Logarithmic Regret
Explores optimal stopping, explore/exploit, Bayes' Rule, and logarithmic regret in bandit solutions.
Dynamic Programming: Rod Cutting and Matrix Chain Multiplication
Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.
Graph Coloring: Random vs Symmetrical
Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.
Design of Experiments Basics
Covers the fundamentals of Design of Experiments (DOE) and experimental strategies.
Paired Tests: Shoe Sole Experiment
Explores paired tests using a shoe sole experiment, showing significant differences between materials A and B.
Markov Chains and Algorithm Applications
Covers the application of Markov chains and algorithms for function optimization and graph colorings.
Algorithms: Definition and Origins
Explores the definition and origins of algorithms, including examples and types.
Information Theory: Basics
Covers the basics of information theory, entropy, and fixed points in graph colorings and the Ising model.
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.
Quick Sort Analysis: Finding k Smallest
Covers the analysis of quick sort, including time complexity and randomization for finding the k-th smallest number.
Previous
Page 1 of 2
Next
