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
Latent Tree Learning
Graph Chatbot
Related lectures (26)
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Untitled
Coin Rendering: Part 1
MOOC: Information, Computation, Communication: Introduction to computational thinking
Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Improved Algorithm: Three-Color Parity Games
Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.
Untitled
Connect Four: Winning Strategy
Explains the winning strategy in Connect Four by checking for winning combinations.
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.
Clustering: k-means
Explains k-means clustering, assigning data points to clusters based on proximity and minimizing squared distances within clusters.
Building Robust Ensembles via Margin Boosting
Delves into building robust ensembles through margin boosting for improved adversarial defense in machine learning models.
PCA: Derivation and Optimization
Covers the derivation of PCA projection, error minimization, and eigenvector optimization.
Untitled
LU Decomposition Algorithm
MOOC: Linear Algebra (Part 1)
Covers the LU decomposition algorithm, transforming a matrix into L and U.
Machine Learning: Fundamentals and Applications
Introduces machine learning basics, covering data segmentation, clustering, classification, and practical applications like image classification and face similarity.
Group Membership and View Synchrony
Log in to Mediaspace to watch this video
Explores group membership and view synchrony in distributed systems, ensuring accurate knowledge and coordinated views.
Total Order Broadcast: Basics and Consensus Equivalences
Log in to Mediaspace to watch this video
Explores total order broadcast and its equivalence to consensus in reliable systems.
Hidden Subgroup Algorithm
Log in to Mediaspace to watch this video
Continues the discussion on Simon's hidden subgroup problem, focusing on finding a basis.
Dijkstra's Algorithm and Probabilistic Analysis
Log in to Mediaspace to watch this video
Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.
Untitled
Log in to Mediaspace to watch this video
Reliable Broadcast: Overview and Algorithms
Log in to Mediaspace to watch this video
Explores reliable broadcast in distributed systems, presenting specifications, algorithms, and properties for different types of broadcast.
Previous
Page 1 of 2
Next
