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
Entropy and Algorithms: Twenty Questions Problem
Graph Chatbot
Related lectures (24)
Previous
Page 1 of 3
Next
Entropy and Algorithms: Applications in Sorting and Weighing
Covers the application of entropy in algorithms, focusing on sorting and decision-making strategies.
Optimization Algorithms: Greedy Approach
Explores optimization problems and greedy algorithms for efficient decision-making.
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 Algorithms
Explores entropy's role in coding strategies and search algorithms, showcasing its impact on information compression and data efficiency.
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.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Lecture: Shannon
Covers the basics of information theory, focusing on Shannon's setting and channel transmission.
Source Coding: Compression
Covers entropy, source coding, encoding maps, decodability, prefix-free codes, and Kraft-McMillan's inequality.
