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
Encoder and Decoder for Prefix-Free Codes
Graph Chatbot
Related lectures (50)
Compression: Kraft Inequality
Explains compression and Kraft inequality in codes and sequences.
Algorithms Exam Preparation
Offers a recap before the Algorithms exam, covering problem-solving strategies and algorithm implementation with sample problems.
Verifying Programs with Stainless: Part 2
Focuses on using Stainless for program verification, demonstrating the process of verifying programs and ensuring correctness.
The Languages of Isabelle: Isar, ML, and Scala
Explores the languages of Isabelle, focusing on Isar, ML, and Scala, covering proof schemes, Natural Deduction rules, inductive definitions, and the LCF approach.
Verifying Compiler: Spec# Approach
Explores the Spec# programming system, focusing on a verifying compiler for C# 2.0.
Hoare Logic: Postconditions and Preconditions
Covers Hoare logic, postconditions, preconditions, and program behavior proofs.
Compression: Prefix-Free Codes
Explains prefix-free codes for efficient data compression and the significance of uniquely decodable codes.
Optimal Binary Search Tree
Explores optimal binary search trees to minimize expected search cost efficiently.
Concept of Proof in Mathematics
Delves into the concept of proof in mathematics, emphasizing the importance of evidence and logical reasoning.
Binary Search Trees: Operations and Implementations
Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.
Proof Techniques: Examples
Covers proof techniques including direct proof, contraposition, contradiction, cases, and counterexample.
Convergence in Law: Theorem and Proof
Explores convergence in law for random variables, including Kolmogorov's theorem and proofs based on probability lemmas.
Coq: Overview
Introduces Coq and focuses on proving the theorem and_comm step by step.
Hoare Logic: Foundations and Applications
Log in to Mediaspace to watch this video
Covers Hoare Logic, its foundations, applications, and significance in program verification.
Formally Verified Chisel Designs
Log in to Mediaspace to watch this video
Explores formally verifying Chisel designs using SMT solvers and covers examples like delayed assertions and proofs by induction.
Optimal Transport: Heat Equation and Metric Spaces
Log in to Mediaspace to watch this video
Explores optimal transport in heat equations and metric spaces.
Zig Zag Lemma
Log in to Mediaspace to watch this video
Covers the Zig Zag Lemma and the long exact sequence of relative homology.
Huffman's Algorithm: Mechanizing the Proof
Log in to Mediaspace to watch this video
Explores the mechanization of Huffman's algorithm proof and functional implementation.
Analysis IV: Measurable Sets and Properties
Log in to Mediaspace to watch this video
Covers the concept of outer measure and properties of measurable sets.
Binary Search Trees: Implementation and Operations
Log in to Mediaspace to watch this video
Covers the implementation and operations of basic data structures like stacks, queues, and linked lists, and introduces binary search trees.
Previous
Page 1 of 3
Next
