Lecture
SmartDataLake: Distributed Analytics over Heterogeneous Data
Related lectures (32)
Card Shuffling Models
Explores models of card shuffling, state spaces, and time complexity.
Complexity of Algorithms: Proofs of Time Complexity
Covers the analysis of worst time complexity for algorithms and time complexity with real numbers and integers.
Extreme Value Theory: GEV and GPD
Covers Extreme Value Theory, focusing on GEV and GPD distributions and the POT Model for threshold exceedances.
Binary Search Trees: Operations and Implementations
Explores binary search trees, covering operations, implementations, and real-world applications involving train tracks.
Binary Search: Basics and ExecutionMOOC: Information, Calcul, Communication: Introduction à la pensée informatique
Explores binary search fundamentals, efficiency, and temporal complexity in algorithmic searching.
Quick Sort Analysis: Finding k Smallest
Covers the analysis of quick sort, including time complexity and randomization for finding the k-th smallest number.
Shor Algorithm: Circuit Details II
Explores the Shor algorithm circuit details for efficient number factoring using quantum computing.
Generalization Theory
Explores generalization theory in machine learning, addressing challenges in higher-dimensional spaces and the bias-variance tradeoff.
Elements of computational complexity
Covers classical and quantum computational complexity concepts and implications.
Quantum Random Number Generation
Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.