Berkeley in the 80s - Episode 1- Shafi Goldwasser
Insightful interview with Turing Laureate Shafi Goldwasser, exploring her groundbreaking research in theoretical computer science, interactive proofs, and zero-knowledge protocols at UC Berkeley in the 1980s.
The AI Trinity - Data + Algorithms + Infrastructure
Explore the AI trinity: data, algorithms, and infrastructure. Learn about named entity recognition, active learning, crowdsourcing, data augmentation, and neural rendering models.
The Future of Wireless and What It Will Enable
Explore the future of wireless technology, its potential, and innovative approaches like millimeter waves, small cells, and software-defined networks to overcome current limitations.
Circuit Lower Bounds from Algorithm Design - An Overview I
Explore circuit lower bounds in computational complexity, focusing on algorithm design techniques and their implications for NP problems and Boolean functions.
An LLL Algorithm for Module Lattices
Explore an LLL algorithm for module lattices, covering key concepts, previous works, and algorithm details. Gain insights into lattice geometry and computational challenges.
Lattices, Multilinear Maps and Program Obfuscation
Explore advanced lattice-based cryptography, focusing on multilinear maps and program obfuscation. Learn about trapdoor sampling, evaluation techniques, and applications in pseudorandom functions and private constraints.
Lattices and Encrypted Computation
Explore lattice-based cryptography, focusing on fully homomorphic encryption and its breakthroughs. Learn about key switching, modular computation, and multi-key encryption in this advanced talk.
Algebraic Lattices and Ring Learning With Errors
Explore algebraic lattices and Ring Learning with Errors, covering key concepts, operations, and hardness theorems in cryptography and lattice-based algorithms.
Complexity of Lattice Problems
Explore lattice problems' complexity, including shortest vector problem, hardness of approximation, and open challenges in lattice-based cryptography.
Algorithms for Lattice Problems
Explore lattice algorithms, complexity, and cryptography, covering key problems, civic algorithms, and open challenges in this comprehensive overview of lattice theory and applications.
Engineering Concurrent Library Components
Explore concurrent algorithms, hardware trends, and Java Memory Model intricacies for engineering robust library components in multi-threaded environments.
ChatGPT and Excel Basics for Beginners
Learn to leverage ChatGPT for enhancing Excel skills, from basic to advanced tasks. Explore AI-powered solutions, ask effective questions, and improve your data handling capabilities.
Greatest Common Divisor of Fibonacci Numbers
Explore the fascinating relationship between Fibonacci numbers and their greatest common divisors through a rigorous mathematical proof and analysis.
An Infinite Product Involving Fibonacci Numbers
Explore closed forms of Fibonacci numbers and discover the value of an intriguing infinite product involving this famous sequence.
Catalan's Identity for Fibonacci Numbers
Explore Catalan's identity for Fibonacci numbers through matrix properties, building on previous proofs of Cassini's and d'Ocagne's identities in this mathematical deep dive.
SGD in the Large - Average-Case Analysis, Asymptotics, and Stepsize Criticality
Explore average-case analysis, asymptotics, and stepsize criticality in stochastic gradient descent, with insights on optimization problems and stochastic momentum techniques.
Polynomial Optimization Applied to Power Network Operations
Explore polynomial optimization techniques for power network operations, focusing on AC Optimal Power Flow challenges and solutions, including robust approaches for handling uncertainties.
Spatial Search on Johnson Graphs by Continuous-Time Quantum Walk
Explore quantum walks on Johnson graphs for spatial search, covering setup, strategies, and analysis of search algorithms and success probabilities.
Recent Advances in Iterative Solvers for Interior Point Methods
Explore recent advancements in iterative solvers for interior point methods, covering linear programming, optimization theory, and applications in big data and compressed sensing.
Approximation Algorithms for Hitting Subgraphs
Explore approximation algorithms for hitting subgraphs, covering inapproximability, NP-hardness, and semi-symmetric cut vertices in this advanced combinatorial algorithms lecture.
Topological Simplification of Voxelized Data
Explore topological simplification of voxelized data, focusing on homological methods to enhance graphical data analysis in scientific fields like medicine and biology.