Media Summary: By Hsin-Hao Su and Hoa T. Vu, from DISC 2020, 34th International Symposium on A basic primitive in graph optimization is that of finding small induced Authors: Lu Qin, Rong-Hua Li, Lijun Chang, Chengqi Zhang Abstract: Mining

Distributed Dense Subgraph Detection And Low Outdegree Orientation - Detailed Analysis & Overview

By Hsin-Hao Su and Hoa T. Vu, from DISC 2020, 34th International Symposium on A basic primitive in graph optimization is that of finding small induced Authors: Lu Qin, Rong-Hua Li, Lijun Chang, Chengqi Zhang Abstract: Mining Authors: A. Erdem Sariyuce: University at Buffalo. Authors: Aristides Gionis, Charalampos E. Tsourakakis Abstract: Finding Chandra Chekuri speaking at Stanford on April 8, 2022 on efficient algorithms for finding

Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick. We dig into SPAD photon-counting sensors and why converting photons into bits can change Find out how the electron backscatter diffraction (EBSD) technique in a scanning electron microscope (SEM) can be fully ... Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary Adam Karczmarz (University of Warsaw ... DISC 2021 — 35th International Symposium on Data collected using the electron backscatter diffraction (EBSD) microanalytical technique is often presented in the form of ...

Differential privacy (DP) has recently emerged as the standard foundation for privacy-preserving machine learning and data ...

Photo Gallery

Distributed Dense Subgraph Detection and Low Outdegree Orientation
Finding Dense Subgraphs
Planted Models for the Densest k-Subgraph Problem
Locally Densest Subgraph Discovery
Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks
Dense Subgraph Discovery - Part 2
Densest Subgraph: Supermodularity, Iterative Peeling, and Flow
Random k-out subgraph leaves only O(n/k) inter-component edges
Seeing Around Corners? We Can Do It, says Tristan Swedish of Ubicept
Learn about EBSD 3: What is orientation mapping?
DISC 2020 session 4
STOC 2022 - Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary
View Detailed Profile
Distributed Dense Subgraph Detection and Low Outdegree Orientation

Distributed Dense Subgraph Detection and Low Outdegree Orientation

By Hsin-Hao Su and Hoa T. Vu, from DISC 2020, 34th International Symposium on

Finding Dense Subgraphs

Finding Dense Subgraphs

A basic primitive in graph optimization is that of finding small induced

Planted Models for the Densest k-Subgraph Problem

Planted Models for the Densest k-Subgraph Problem

Presentation slides available at https://drive.google.com/file/d/1Qu_KIfZz7k_-nkT11wffnZvk7gF7EbQ1/view?usp=sharing.

Locally Densest Subgraph Discovery

Locally Densest Subgraph Discovery

Authors: Lu Qin, Rong-Hua Li, Lijun Chang, Chengqi Zhang Abstract: Mining

Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks

Motif-driven Dense Subgraph Discovery in Directed and Labeled Networks

Authors: A. Erdem Sariyuce: University at Buffalo.

Dense Subgraph Discovery - Part 2

Dense Subgraph Discovery - Part 2

Authors: Aristides Gionis, Charalampos E. Tsourakakis Abstract: Finding

Densest Subgraph: Supermodularity, Iterative Peeling, and Flow

Densest Subgraph: Supermodularity, Iterative Peeling, and Flow

Chandra Chekuri speaking at Stanford on April 8, 2022 on efficient algorithms for finding

Random k-out subgraph leaves only O(n/k) inter-component edges

Random k-out subgraph leaves only O(n/k) inter-component edges

Jacob Holm, Valerie King, Mikkel Thorup, Or Zamir, Uri Zwick.

Seeing Around Corners? We Can Do It, says Tristan Swedish of Ubicept

Seeing Around Corners? We Can Do It, says Tristan Swedish of Ubicept

We dig into SPAD photon-counting sensors and why converting photons into bits can change

Learn about EBSD 3: What is orientation mapping?

Learn about EBSD 3: What is orientation mapping?

Find out how the electron backscatter diffraction (EBSD) technique in a scanning electron microscope (SEM) can be fully ...

DISC 2020 session 4

DISC 2020 session 4

... session 0:10

STOC 2022 - Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary

STOC 2022 - Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary

Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary Adam Karczmarz (University of Warsaw ...

Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model

Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model

DISC 2021 — 35th International Symposium on

Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels

Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels

DISC 2021 — 35th International Symposium on

Understanding Orientation Maps in EBSD

Understanding Orientation Maps in EBSD

Data collected using the electron backscatter diffraction (EBSD) microanalytical technique is often presented in the form of ...

Antti Honkela: Accurate privacy accounting for differentially private machine learning

Antti Honkela: Accurate privacy accounting for differentially private machine learning

Differential privacy (DP) has recently emerged as the standard foundation for privacy-preserving machine learning and data ...