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

#Dynamic Graphs

Showing: 22 courses
MLOps World: Machine Learning in Production

Machine Learning on Dynamic Graphs - Temporal Graph Networks

0 rewiews
Explore Temporal Graph Networks for dynamic graph analysis, unlocking insights in evolving systems like social networks and financial transactions.
Add to list
1 Lesons
45 minutes
On-Demand
Free-Video

Data Visualization GUIs with Dash and Python

0 rewiews
Learn to create interactive data visualization interfaces using Dash and Python, covering dynamic graphs, live updates, sentiment analysis, and app deployment for effective data presentation.
Add to list
12 Lesons
3 hours 30 minutes
On-Demand
Free-Video
Simons Institute

A Blackbox Reduction for Adaptive Adversaries Using Differential Privacy

0 rewiews
Explore a novel black-box transformation using differential privacy to convert dynamic algorithms from oblivious to adaptive adversary resistance, enhancing algorithm design for dynamic graphs.
Add to list
1 Lesons
47 minutes
On-Demand
Free-Video
Simons Institute

Parallel Batch-Dynamic Graph Representations

0 rewiews
Explore efficient dynamic graph representations with Aspen and CPAM frameworks, enabling faster updates and space-efficient algorithms for practical applications like dynamic connectivity.
Add to list
1 Lesons
53 minutes
On-Demand
Free-Video
Simons Institute

Dynamic Algorithms for Center on Graphs

0 rewiews
Efficient approximation algorithms for k-center problem on dynamic graphs with edge updates. Explores novel techniques in dynamic graph theory and algorithm design.
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
IEEE

Tight Bounds for Online Edge Coloring

0 rewiews
Explore cutting-edge algorithms for online edge coloring, examining tight bounds and their implications in graph theory and network optimization.
Add to list
1 Lesons
22 minutes
On-Demand
Free-Video
Simons Institute

Dynamic PageRank: Additive Error and Batch Recomputation

0 rewiews
Explores dynamic PageRank algorithms, proving hardness of relative error approximations and demonstrating efficiency of batch recomputation for L1 error metric in dynamic graph settings.
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
Simons Institute

Decremental Shortest Paths Against an Adaptive Adversary

0 rewiews
Explore efficient algorithms for maintaining shortest paths in dynamic graphs undergoing deletions, with a focus on near-optimal deterministic data structures and adaptive adversary scenarios.
Add to list
1 Lesons
1 hour 2 minutes
On-Demand
Free-Video
Simons Institute

Minimum Isolating Cuts - A New Tool for Solving Minimum Cut Problems

0 rewiews
Explore a powerful new tool for solving minimum cut problems in combinatorial optimization, with applications to global, Steiner, and all-pairs min-cut algorithms.
Add to list
1 Lesons
41 minutes
On-Demand
Free-Video
Simons Institute

On Dynamic Graph Approximations - The Case of J-Trees

0 rewiews
Explores dynamic maintenance of j-trees in graph theory, discussing implications for cut-based optimization, maximum flows, and minimum cost-flow computations in algorithmic design.
Add to list
1 Lesons
53 minutes
On-Demand
Free-Video
Scalable Parallel Computing Lab, SPCL @ ETH Zurich

HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers

0 rewiews
Explore higher-order dynamic graph representation learning with efficient Transformers for improved link prediction in rapidly changing graphs. Learn about HOT model's architecture and performance.
Add to list
9 Lesons
20 minutes
On-Demand
Free-Video
Aleksa Gordić - The AI Epiphany

How to Get Started With Graph ML - Blog Walkthrough

0 rewiews
Comprehensive introduction to Graph Machine Learning, covering applications, methods, and resources. Explores research challenges, GNN expressivity, and related subfields, providing a solid foundation for beginners.
Add to list
18 Lesons
47 minutes
On-Demand
Free-Video
Aleksa Gordić - The AI Epiphany

Temporal Graph Networks - GNN Paper Explained

0 rewiews
Explore temporal graph networks and dynamic graphs, learning advanced techniques for graph machine learning, including time-based sampling, memory management, and attention mechanisms.
Add to list
15 Lesons
39 minutes
On-Demand
Free-Video
Simons Institute

Recent Progress on Sublinear Time Algorithms for Maximum Matching - Upper Bounds

0 rewiews
Explore sublinear time algorithms for estimating maximum matching size in graphs, their applications in dynamic graphs, and recent advancements in the field.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
Simons Institute

Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates

0 rewiews
Explore dynamic algorithms for packing-covering LPs using multiplicative weight updates, focusing on near-optimal approximation algorithms and complexity analysis in dynamic settings.
Add to list
1 Lesons
47 minutes
On-Demand
Free-Video
Simons Institute

Online List Labeling - Breaking the Log^2 N Barrier

0 rewiews
Explores a randomized data structure for online list labeling, improving the upper bound to O(log^{3/2} n) items moved per insertion/deletion, breaking the long-standing log^2 n barrier.
Add to list
1 Lesons
49 minutes
On-Demand
Free-Video
Simons Institute

Faster High Accuracy Multi-Commodity Flows via Graph Techniques

0 rewiews
Explore graph techniques to accelerate multi-commodity flow algorithms, improving accuracy and efficiency. Discover connections to linear programming and open problems in algorithm design.
Add to list
1 Lesons
45 minutes
On-Demand
Free-Video
Simons Institute

Accelerating the Multiplicative-Weights Framework for Graph Linear Programs

0 rewiews
Accelerated multiplicative-weight updates framework for solving packing/covering LPs in graph optimization, reducing iterations from Θ(m) to ~Θ(√m) using a packing version of Min-IP oracle.
Add to list
1 Lesons
53 minutes
On-Demand
Free-Video
Simons Institute

Recent Progress on Sublinear Time Algorithms for Maximum Matching - Lower Bounds

0 rewiews
Explore recent techniques for estimating maximum matching size, focusing on lower bounds and correlation decay methods that lead to super-linear lower bounds for approximations above 2/3.
Add to list
1 Lesons
47 minutes
On-Demand
Free-Video
IEEE

Sensitive Distance and Reachability Oracles for Large Batch Updates

0 rewiews
Explore efficient algorithms for maintaining distance and reachability information in dynamic graphs, focusing on techniques for handling large batch updates.
Add to list
1 Lesons
20 minutes
On-Demand
Free-Video
IEEE

Dynamic Graphs - Session 8B

0 rewiews
Explore cutting-edge research on dynamic graph algorithms and their applications in computer science at this IEEE FOCS 2020 session.
Add to list
1 Lesons
1 hour 33 minutes
On-Demand
Free-Video
IEEE

Dynamic Graphs - Session 7B

0 rewiews
Explore cutting-edge research on dynamic graph algorithms and their applications in computer science at this IEEE FOCS 2020 session.
Add to list
1 Lesons
1 hour 19 minutes
On-Demand
Free-Video