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
Entropy and Algorithms: Twenty Questions Problem
Graph Chatbot
Related lectures (46)
Entropy and Algorithms: Applications in Sorting and Weighing
Covers the application of entropy in algorithms, focusing on sorting and decision-making strategies.
Compression: Prefix-Free Codes
Explains prefix-free codes for efficient data compression and the significance of uniquely decodable codes.
Compression: Kraft Inequality
Explains compression and Kraft inequality in codes and sequences.
Compression
Covers the concept of compression and constructing prefix-free codes based on given information.
Entropy and Data Compression: Huffman Coding Techniques
Discusses entropy, data compression, and Huffman coding techniques, emphasizing their applications in optimizing codeword lengths and understanding conditional entropy.
Compression: Strong Connection and Prefix-Free Codes
Explores the relationship between code word length and probability distribution, focusing on designing prefix-free codes for efficient compression.
Information Measures: Entropy and Information Theory
Explains how entropy measures uncertainty in a system based on possible outcomes.
Source Coding Theorem
Explores the Source Coding Theorem, entropy, Huffman coding, and conditioning's impact on entropy reduction.
Differentiable Ranking and Sorting
Explores differentiable ranking and sorting techniques for machine learning applications.
Introduction to Algorithms: Course Overview and Basics
Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.
Compression: Prediction
Covers the concepts of compression and prediction using prefix-free codes and distributions.
Search Algorithms: Two Examples
Covers basic algorithm ingredients, search algorithms, control structures, and algorithm correctness.
Generalization Error
Explores generalization error in machine learning, focusing on data distribution and hypothesis impact.
Algorithms: Summary of the week
Covers algorithms for searching, sorting, optimization, and the Halting Problem.
Conditional Entropy and Data Compression Techniques
Log in to Mediaspace to watch this video
Discusses conditional entropy and its role in data compression techniques.
Introduction to Algorithms: Basics and Importance
Log in to Mediaspace to watch this video
Covers the basics of algorithms, the importance of studying them, data structures, and the impact of algorithms on various fields.
Algorithms in Computer Science: Search and Sort Techniques
Log in to Mediaspace to watch this video
Provides an overview of essential search and sort algorithms in computer science.
Sparsest Cut: Leighton-Rao Algorithm
Log in to Mediaspace to watch this video
Covers the Leighton-Rao algorithm for finding the sparsest cut in a graph, focusing on its steps and theoretical foundations.
Pointers: Strings, Functions, Casting
Log in to Mediaspace to watch this video
Covers pointers to strings, functions, and casting in C programming.
Merge Sort: Divide, Conquer, Combine
Log in to Mediaspace to watch this video
Explores Merge Sort, a sorting algorithm that divides, conquers, and combines arrays efficiently to achieve O(nlog n) time complexity.
Previous
Page 1 of 3
Next
