Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Online Matching in Evolving Environments
Graph Chatbot
Related lectures (52)
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.
Spatial Statistics: Significance
Explains the calculation of statistical significance in spatial statistics using permutation and randomization methods.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Statistical Physics of Clusters
Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.
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.
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.
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.
Observational Studies: Pitfalls and Valid Conclusions
Highlights the pitfalls of observational studies and the importance of randomized experiments.
Probabilistic Analysis: Hiring & Birthday Paradox
Explores probabilistic analysis in algorithms, covering the hiring problem and the birthday paradox, along with hash tables and functions.
Algorithms: Union Find and Minimum Spanning Trees
Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.
C++ Standard Library: Containers and Algorithms
Explores containers and algorithms in the C++ standard library, including find, copy, and sort functionalities.
Graph Algorithms: Ford-Fulkerson and Strongly Connected Components
Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.
Protein Mass Spectrometry and Proteomics: Randomization Overview
Log in to Mediaspace to watch this video
Explores the significance of randomization in protein mass spectrometry and proteomics, highlighting its role in minimizing bias and ensuring research validity.
Optimizing Join Operations: Challenges and Solutions
Log in to Mediaspace to watch this video
Explores optimizing join operations in distributed systems, addressing skewness and introducing the 1-Bucket-Theta algorithm.
Design of Experiments Basics
Log in to Mediaspace to watch this video
Covers the fundamentals of Design of Experiments (DOE) and experimental strategies.
Previous
Page 1 of 3
Next
