Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Randomized Algorithms

Showing: 32 courses
NPTEL

Introduction to Cryptology

1 rewiews
Explore cryptology fundamentals, including ciphers, perfect secrecy, public key systems, and hash functions. Learn algorithms and techniques for secure communication and data protection.
Add to list
20 Lesons
10 hours
On-Demand
Free-Video
Simons Institute

Foundations of Data Science II

0 rewiews
Explore advanced data science concepts including SVD, Gaussian mixtures, and Markov chains. Learn about randomized algorithms and low-rank approximations for efficient data handling.
Add to list
17 Lesons
55 minutes
On-Demand
Free-Video
Simons Institute

Sketching and Randomized Linear Algebra

0 rewiews
Explore advanced techniques in randomized linear algebra, focusing on sketching methods for efficient data analysis and algorithm design in high-dimensional spaces.
Add to list
1 Lesons
1 hour 4 minutes
On-Demand
Free-Video
Institute for Advanced Study

Expanders and Property Testing

0 rewiews
Explore expanders and property testing in graph theory, focusing on their applications and connections to theoretical computer science.
Add to list
1 Lesons
19 minutes
On-Demand
Free-Video
NPTEL-NOC IITM

Karger's Mincut Algorithm - Introduction and Implementation

0 rewiews
Explore Karger's mincut algorithm, its motivation, problem definition, and implementation through a practical example.
Add to list
5 Lesons
10 minutes
On-Demand
Free-Video
Simons Institute

Stochastic Minimum Vertex Cover with Few Queries: A 3/2-Approximation

0 rewiews
Explore a 3/2-approximation algorithm for stochastic vertex cover using O(n/p) non-adaptive queries, improving upon previous 2-approximation methods and discussing extensions to correlated edge realizations.
Add to list
1 Lesons
30 minutes
On-Demand
Free-Video
Simons Institute

Graph Connectivity Using Star Contraction

0 rewiews
Explore edge connectivity in simple graphs using cut queries, introducing star contraction for efficient graph simplification and discussing randomized and quantum algorithms for connectivity determination.
Add to list
1 Lesons
31 minutes
On-Demand
Free-Video
Simons Institute

Sketching Techniques for Data Structures and Optimization - Part 2

0 rewiews
Explore advanced sketching techniques for data structures and optimization in fast algorithms, focusing on practical applications and theoretical foundations.
Add to list
1 Lesons
1 hour 6 minutes
On-Demand
Free-Video
Simons Institute

Sketching Techniques for Data Structures and Optimization - Part 1

0 rewiews
Explore data structure optimization techniques for fast algorithms, focusing on sketching methods to enhance computational efficiency and performance.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
Centre for Networked Intelligence, IISc

Designing Robust Algorithms for Data Streams with Adversarial Generation

0 rewiews
Explore advanced techniques for designing robust streaming algorithms that maintain accuracy even under adversarial data manipulation, focusing on Missing Item Finding and graph coloring challenges.
Add to list
1 Lesons
1 hour 15 minutes
On-Demand
Free-Video
Centre for Networked Intelligence, IISc

Coresets for Machine Learning - Tensor Factorization and Bregman Clustering

0 rewiews
Explore advanced techniques for data summarization through coresets, focusing on tensor factorization and Bregman clustering, with applications in efficient machine learning algorithms for massive datasets.
Add to list
1 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Churchill CompSci Talks

Randomised Computation

0 rewiews
Explore probabilistic Turing machines, complexity classes, and efficient randomised algorithms. Dive into Monte Carlo methods, polynomial identity testing, and the P = BPP problem.
Add to list
7 Lesons
31 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Nearly Optimal Static Las Vegas Succinct Dictionary

0 rewiews
Explore advanced data structures for efficient dictionary operations, focusing on succinct representations and optimizing space usage for various input types.
Add to list
11 Lesons
25 minutes
On-Demand
Free-Video
IEEE

Towards Optimal Separations between Quantum and Randomized Query Complexities

0 rewiews
Explore the intriguing gap between quantum and randomized query complexities, delving into cutting-edge research on optimal separations and their implications for computational theory.
Add to list
1 Lesons
36 minutes
On-Demand
Free-Video
Churchill CompSci Talks

Sublinear Time Property Testers - Algorithms for Efficient Function Analysis

0 rewiews
Explore sublinear time property testers for efficient algorithm design. Learn about relaxed decision problems, fast testers, and applications in graph theory and string processing.
Add to list
1 Lesons
28 minutes
On-Demand
Free-Video
Simons Institute

Approximating the TV Distance Between Two Product Distributions

0 rewiews
Explore techniques for approximating total variation distance between high-dimensional product distributions, including randomized coupling and deterministic sparsification methods.
Add to list
1 Lesons
44 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Randomized Algorithms for Rounding and Rank Compression in the Tensor Train Format

0 rewiews
Explore randomized algorithms for efficient tensor-train rounding, enhancing performance in quantum systems and condensed matter physics applications with significant computational speedups.
Add to list
1 Lesons
41 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Algorithms Approaching the Threshold for Semirandom Planted Clique

0 rewiews
Explore advanced algorithms for semirandom planted clique problems with Princeton researcher Pravesh Kothari, discussing computational and statistical challenges in learning and optimization.
Add to list
1 Lesons
55 minutes
On-Demand
Free-Video
Simons Institute

Sublinear Time Algorithms for Estimating Edit Distance

0 rewiews
Explore efficient methods for approximating edit distance between strings, focusing on sublinear time algorithms and their applications in computational biology and text processing.
Add to list
1 Lesons
1 hour 8 minutes
On-Demand
Free-Video
Simons Institute

Sublinear Insights: A Faster Classical Algorithm for Edge Coloring

0 rewiews
Explores a novel randomized algorithm for near-linear time graph edge coloring, improving on decades-old methods. Discusses implications for Vizing's theorem and dense graph coloring efficiency.
Add to list
1 Lesons
34 minutes
On-Demand
Free-Video
Simons Institute

Shaving Logs by Weighing Coins - Extroverted Sublinear Algorithms

0 rewiews
Explore innovative sublinear algorithms for efficient data analysis, focusing on log-shaving techniques and coin-weighing problems in computational complexity.
Add to list
1 Lesons
39 minutes
On-Demand
Free-Video
Simons Institute

Applications of Sub-linear Algorithms in Other Fields

0 rewiews
Explore how sub-linear algorithms impact diverse fields, enhancing efficiency and scalability in data analysis and problem-solving across disciplines.
Add to list
1 Lesons
31 minutes
On-Demand
Free-Video
IEEE

A New Minimax Theorem for Randomized Algorithms

0 rewiews
Explore a novel minimax theorem for randomized algorithms, comparing it with Yao's minimax and discussing its implications for algorithm analysis and design.
Add to list
9 Lesons
25 minutes
On-Demand
Free-Video
Strange Loop Conference

Compacting the Uncompactable

0 rewiews
Innovative memory allocation technique eliminating fragmentation in C/C++ programs, reducing memory consumption and improving performance without modifying existing code.
Add to list
18 Lesons
40 minutes
On-Demand
Free-Video
ACM SIGPLAN

Probabilistic Programming with Stochastic Probabilities

0 rewiews
Explore a novel approach to probabilistic programming languages using stochastic probability estimation, enabling unrestricted stochastic control flow and programmable inference with custom proposals.
Add to list
1 Lesons
20 minutes
On-Demand
Free-Video
HUJI Machine Learning Club

Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension

0 rewiews
Delve into optimal prediction strategies and online learning theory through exploration of expert advice systems and the randomized Littlestone dimension, focusing on practical applications in weather forecasting and image classification.
Add to list
1 Lesons
59 minutes
On-Demand
Free-Video
USC Probability and Statistics Seminar

Online k-means Clustering on Arbitrary Data Streams - Lecture

0 rewiews
Explore online k-means clustering for arbitrary data streams, focusing on a novel algorithm with polynomial space and time complexity and provable guarantees without input assumptions.
Add to list
16 Lesons
37 minutes
On-Demand
Free-Video
Simons Institute

Optimal Quantile Estimation for Streams

0 rewiews
Explore optimal quantile estimation for data streams, focusing on space-efficient algorithms and recent advancements in deterministic sketching techniques for improved accuracy and memory usage.
Add to list
1 Lesons
38 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Derandomization and Meta-complexity - Part 2

0 rewiews
Explore meta-complexity in derandomization through an advanced tutorial. Delve into cutting-edge mathematical concepts and their applications in randomness and complexity theory.
Add to list
1 Lesons
1 hour 8 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Derandomization: Pseudo-randomness from Hardness - Part 1

0 rewiews
Explore pseudo-randomness from hardness in derandomization with Valentine Kabanets. Gain insights into this mathematical concept through a comprehensive tutorial.
Add to list
1 Lesons
1 hour 15 minutes
On-Demand
Free-Video
Centre International de Rencontres Mathématiques

Probabilistic Methods - Entropy Compression

0 rewiews
Explore probabilistic methods and entropy compression in mathematics through an in-depth lecture by František Kardoš at CIRM's ALEA days conference.
Add to list
1 Lesons
1 hour 11 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Constant-Cost Communication in Randomized Computing

0 rewiews
Explore the fascinating role of randomness in communication complexity, focusing on efficient protocols for solving equality problems and their broader implications in computing theory.
Add to list
1 Lesons
1 hour 14 minutes
On-Demand
Free-Video