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

#Sublinear Algorithms

Showing: 59 courses
Simons Institute

Locally Private Histograms in All Privacy Regimes

0 rewiews
Explore frequency estimation in data analysis, focusing on local differential privacy. Learn about algorithms, error bounds, and the intriguing low-privacy regime in histogram computation.
Add to list
1 Lesons
26 minutes
On-Demand
Free-Video
Simons Institute

Adaptive Sparse Recovery with Limited Adaptivity

0 rewiews
Explore techniques for efficient sparse signal recovery using limited adaptive measurements, with applications in sublinear algorithms and nearest-neighbor search.
Add to list
1 Lesons
42 minutes
On-Demand
Free-Video
Simons Institute

High Dimensional Robust Sparse Regression

0 rewiews
Explore advanced techniques for robust sparse regression in high-dimensional data, focusing on sublinear algorithms and nearest-neighbor search methods.
Add to list
1 Lesons
45 minutes
On-Demand
Free-Video
Simons Institute

Graph Coloring Through the Sublinear Lens

0 rewiews
Explore sublinear algorithms for graph coloring, examining innovative approaches and their applications in computational efficiency and problem-solving in graph theory.
Add to list
1 Lesons
1 hour 3 minutes
On-Demand
Free-Video
Simons Institute

Property Testing for Graphs

0 rewiews
Explore advanced techniques in property testing for graphs, focusing on sublinear algorithms and their applications in large-scale network analysis.
Add to list
1 Lesons
1 hour 23 minutes
On-Demand
Free-Video
Simons Institute

Counting Subgraphs in Sublinear Time

0 rewiews
Explore key randomization techniques for estimating subgraph counts without reading entire graphs, focusing on average degree and triangle count estimation methods.
Add to list
1 Lesons
1 hour 2 minutes
On-Demand
Free-Video
Simons Institute

Distribution Testing - Hypothesis Testing from Very Little or Very Private Data

0 rewiews
Explore hypothesis testing techniques for distribution analysis using limited or private datasets, focusing on sublinear algorithms and their applications in data science.
Add to list
1 Lesons
1 hour 17 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
Simons Institute

Sparsifying Set Systems for Coverage Problems

0 rewiews
Explore recent advancements in sparsifying set systems for coverage problems, focusing on sublinear graph simplification techniques.
Add to list
1 Lesons
35 minutes
On-Demand
Free-Video
Simons Institute

Improved Streaming Algorithms for Max-DICUT via Local Snapshots

0 rewiews
Explore advanced streaming algorithms for Max-DICUT problem, focusing on local graph snapshots to surpass the 4/9 approximation in sublinear space.
Add to list
1 Lesons
45 minutes
On-Demand
Free-Video
Simons Institute

Approximating Maximum Matching Requires Almost Quadratic Time

0 rewiews
Explore algorithms for estimating maximum matching size, focusing on recent advancements and lower bounds. Gain insights into subquadratic time complexity and its limitations in graph theory.
Add to list
1 Lesons
24 minutes
On-Demand
Free-Video
Simons Institute

Online Algorithms for Spectral Hypergraph Sparsification

0 rewiews
Explore online algorithms for spectral hypergraph sparsification, focusing on space-efficient methods for handling streaming hyperedges and producing accurate sparsifiers.
Add to list
1 Lesons
32 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

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs

0 rewiews
Explore advanced algorithms for dynamic maximum matching using Ordered Ruzsa-Szemeredi Graphs, improving update time to n^{o(1)} * ORS(n) and reducing the problem to a combinatorial bound.
Add to list
1 Lesons
44 minutes
On-Demand
Free-Video
Simons Institute

New Algorithms for Directed Spanner Problems and Generalizations

0 rewiews
Explore recent advancements in directed spanner algorithms, including online and offline settings, weighted variants, and buy-at-bulk extensions.
Add to list
1 Lesons
34 minutes
On-Demand
Free-Video
Simons Institute

Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs - Towards Constructive Matching Sparsifiers

0 rewiews
Explore approaches for designing fast dynamic algorithms for approximate matchings, focusing on fully dynamic settings and the concept of matching sparsifiers in graph theory.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
Simons Institute

Maximum Matching in O(log log n) Passes in Dynamic Streams

0 rewiews
Explore an algorithm for approximating maximum matching in dynamic streams, achieving O(1)-approximation in O(log log n) passes and O(n poly log n) space, with lower bound proof.
Add to list
1 Lesons
40 minutes
On-Demand
Free-Video
Simons Institute

Planar Partition Oracles for Bounded Degree Graphs in Polynomial Time

0 rewiews
Explore planar graph partition oracles for bounded degree graphs, focusing on hyperfinite decompositions and their applications in sublinear algorithms and property testing.
Add to list
1 Lesons
34 minutes
On-Demand
Free-Video
Simons Institute

Subgraph Counting and Seed Counting in Graph Theory

0 rewiews
Explore sublinear subgraph counting and sampling techniques, focusing on the advantages of counting seeds in graph analysis.
Add to list
1 Lesons
41 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

Linear Sketching Hypergraph Sparsifiers

0 rewiews
Explore linear sketching techniques for hypergraph sparsification, examining upper and lower bounds, dynamic streaming algorithms, and novel methods like random fingerprinting for efficient cut preservation.
Add to list
1 Lesons
34 minutes
On-Demand
Free-Video
Simons Institute

Maximal Matching in Bounded-deletion Streams

0 rewiews
Explore maximal matching in bounded-deletion graph streams, analyzing space complexity as a function of deletion parameter K. Gain insights into algorithmic techniques and lower bound results.
Add to list
1 Lesons
38 minutes
On-Demand
Free-Video
Simons Institute

Hypothesis Selection with Computational Constraints

0 rewiews
Explore optimal tradeoffs between memory, sample complexity, and time in hypothesis selection algorithms for distribution matching, with focus on achieving near-optimal accuracy efficiently.
Add to list
1 Lesons
32 minutes
On-Demand
Free-Video
Simons Institute

Randomized Least Squares Optimization and its Incredible Utility for Large-Scale Tensor Decomposition

0 rewiews
Explore randomized least squares optimization techniques for large-scale tensor decomposition, focusing on sublinear algorithms and their applications in data analysis.
Add to list
1 Lesons
33 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Sampling-Based Sublinear Low-Rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

0 rewiews
Explore quantum-inspired classical algorithms for machine learning, focusing on sublinear low-rank matrix arithmetic and singular value transformation techniques.
Add to list
9 Lesons
21 minutes
On-Demand
Free-Video
Simons Institute

Learning-Augmented Sketches for Frequency Estimation

0 rewiews
Explore advanced techniques for frequency estimation using learning-augmented sketches, enhancing sublinear algorithms and nearest-neighbor search methodologies.
Add to list
1 Lesons
46 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

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

New Advances on Multi-Pass Graph Streaming Lower Bounds

0 rewiews
Explore cutting-edge developments in multi-pass graph streaming lower bounds, focusing on sublinear algorithms and their applications in data analysis and network theory.
Add to list
1 Lesons
1 hour 5 minutes
On-Demand
Free-Video
Simons Institute

Coresets and Their Applications to Design Sublinear Algorithms

0 rewiews
Explore coresets and their role in designing efficient sublinear algorithms, enhancing computational performance for large-scale data analysis and machine learning tasks.
Add to list
1 Lesons
52 minutes
On-Demand
Free-Video
Simons Institute

Adversarially Robust Streaming Algorithms

0 rewiews
Explore techniques for designing streaming algorithms that maintain accuracy under adversarial data manipulation, enhancing resilience in data processing systems.
Add to list
1 Lesons
1 hour 3 minutes
On-Demand
Free-Video
Simons Institute

An Overview of Data Streams Algorithms

0 rewiews
Explore efficient algorithms for processing massive data streams, focusing on space-saving techniques and approximation methods for real-time analysis and decision-making.
Add to list
1 Lesons
1 hour 21 minutes
On-Demand
Free-Video
Simons Institute

An Introduction to Distributed, Massively Parallel, and Local Computation Algorithms

0 rewiews
Explore distributed, massively parallel, and local computation algorithms, focusing on their applications, challenges, and recent advancements in sublinear algorithmic techniques.
Add to list
1 Lesons
1 hour 20 minutes
On-Demand
Free-Video
Simons Institute

Testing Boolean Functions

0 rewiews
Explore efficient algorithms for testing Boolean function properties, covering definitions, variants, and key analyses in sublinear complexity.
Add to list
1 Lesons
1 hour 2 minutes
On-Demand
Free-Video
Simons Institute

Sampling Big Ideas in Sublinear Algorithms

0 rewiews
Explore random sampling techniques for enhancing data analysis scalability, focusing on weighted and coordinated sampling schemes for streamed or distributed data.
Add to list
1 Lesons
1 hour 4 minutes
On-Demand
Free-Video
Simons Institute

Extroverted Sublinear Algorithms

0 rewiews
Explore extroverted sublinear algorithms with Google Brain researcher Ilya Mironov, delving into innovative computational techniques for efficient data processing and analysis.
Add to list
1 Lesons
25 minutes
On-Demand
Free-Video
Simons Institute

Sublinear Time Algorithms for Max-Cut Approximation on Expander Graphs

0 rewiews
Explore random walks on graphs to achieve better-than-1/2 approximation for max-cut on expanding and clusterable graphs, using sublinear time algorithms.
Add to list
1 Lesons
32 minutes
On-Demand
Free-Video
Simons Institute

Linear and Sublinear Algorithms for Graphlet Sampling

0 rewiews
Explore efficient algorithms for graphlet sampling, including linear and sublinear preprocessing techniques, with applications to semi-streaming and MPC settings.
Add to list
1 Lesons
33 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

Long-context Attention in Near-Linear Time

0 rewiews
Explores HyperAttention, an innovative approach to tackle computational challenges in long-context LLMs, offering significant speed improvements while maintaining performance across various datasets.
Add to list
1 Lesons
41 minutes
On-Demand
Free-Video
Simons Institute

Efficiently Computing Similarities to Private Datasets

0 rewiews
Explore advanced techniques for computing similarities to private datasets, focusing on extroverted sublinear algorithms and their applications in data privacy.
Add to list
1 Lesons
30 minutes
On-Demand
Free-Video
Simons Institute

O(log s)-Approximate Nearest Neighbor Search for Earth Mover's Distance

0 rewiews
Explore advancements in nearest neighbor search for Earth Mover's Distance, improving approximation to Õ(log s) with sublinear query time using data-dependent LSH functions and tree embedding techniques.
Add to list
1 Lesons
37 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

New Upper and Lower Bounds on Approximate Counting

0 rewiews
Explores new upper and lower bounds for approximate counting, addressing amortized space complexity and memory optimization in maintaining arrays of approximate counters.
Add to list
1 Lesons
48 minutes
On-Demand
Free-Video
IEEE

Sublinear Algorithms for Gap Edit Distance

0 rewiews
Explore sublinear algorithms for efficiently computing gap edit distance, including dynamic programming, approximation techniques, and key theoretical results.
Add to list
16 Lesons
21 minutes
On-Demand
Free-Video
TheIACR

Sublinear Zero Knowledge Arguments for RAM Programs

0 rewiews
Explore cutting-edge cryptographic techniques for efficient zero-knowledge proofs in RAM programs, enhancing privacy and security in computational systems.
Add to list
1 Lesons
20 minutes
On-Demand
Free-Video
Simons Institute

Sublinear Algorithms and Complexity Theory Vignettes

0 rewiews
Explore key concepts and applications of sublinear algorithms through practical vignettes, focusing on efficient computational methods and algorithmic complexity.
Add to list
1 Lesons
14 minutes
On-Demand
Free-Video
Simons Institute

Simple Sublinear Algorithms for Vertex Coloring

0 rewiews
Dive into advanced graph theory concepts and efficient vertex coloring algorithms, exploring sublinear approaches for optimizing computational complexity.
Add to list
1 Lesons
14 minutes
On-Demand
Free-Video
Conf42

Sketching Algorithms: Making Sense of Big Data in a Single Stroke

0 rewiews
Explore sketching algorithms for efficient big data processing, covering concepts, design principles, and practical applications using open-source tools like Apache DataSketches.
Add to list
29 Lesons
24 minutes
On-Demand
Free-Video
Simons Institute

Agnostic Proper Learning of Monotone Functions: Beyond the Black-Box Correction Barrier

0 rewiews
Explore efficient algorithms for agnostic, proper learning of monotone Boolean functions, overcoming previous limitations and achieving near-optimal runtime complexity.
Add to list
1 Lesons
24 minutes
On-Demand
Free-Video
Simons Institute

Sublinear Algorithms for Correlation Clustering

0 rewiews
Explore sublinear algorithms for correlation clustering, focusing on a 3+eps approximation method using LCA probes, MPC rounds, and dynamic updates. Analyze technical results for maximal independent set computation.
Add to list
1 Lesons
50 minutes
On-Demand
Free-Video
Simons Institute

Fast Streaming Euclidean Clustering with Constant Space

0 rewiews
Explore streaming algorithms for k-median and k-means clustering, achieving constant space complexity independent of data size and aspect ratio. Improve space and update time for approximate subspace embeddings.
Add to list
1 Lesons
31 minutes
On-Demand
Free-Video
Simons Institute

Sparsification for Communication-Efficient Distributed Symmetry-Breaking

0 rewiews
Explore sparsification techniques for efficient distributed algorithms, focusing on local symmetry-breaking problems in graph theory and the CONGEST model.
Add to list
1 Lesons
32 minutes
On-Demand
Free-Video
Simons Institute

Recent Progress on Euclidean Spanners

0 rewiews
Explore recent advancements in Euclidean spanners, including sparse, light, fault-tolerant, and dynamic variants, while discovering outstanding open problems in the field.
Add to list
1 Lesons
36 minutes
On-Demand
Free-Video
Simons Institute

A Quasi-Monte Carlo Algorithm for Smooth Kernel Evaluation

0 rewiews
Explore a novel data structure for density queries, combining discrepancy theory and LSH to build sparse coresets and enhance smooth kernel evaluation algorithms.
Add to list
1 Lesons
42 minutes
On-Demand
Free-Video
Simons Institute

Parallel Algorithms for Local Problems in Sparse Graphs

0 rewiews
Explore efficient parallel algorithms for locally checkable problems in sparse graphs, focusing on techniques beyond graph sparsification for improved performance in sublinear regimes.
Add to list
1 Lesons
36 minutes
On-Demand
Free-Video
Simons Institute

Tolerant Property Testing and Distance Approximation in Sublinear Algorithms

0 rewiews
Explore tolerant property testing and distance approximation algorithms for various object types and properties. Gain insights into bipartiteness, monotonicity, uniformity, and subsequence-freeness.
Add to list
1 Lesons
59 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
Simons Institute

Sublinear Algorithms in Social Networks via Core-Periphery Decomposition

0 rewiews
Explore sublinear algorithms for large networks using core-periphery structure and degree distribution. Learn about accelerating tasks like node sampling and shortest path computations.
Add to list
1 Lesons
40 minutes
On-Demand
Free-Video