Picture for Rasmus Pagh

Rasmus Pagh

Faster Private Minimum Spanning Trees

Add code
Aug 13, 2024
Figure 1 for Faster Private Minimum Spanning Trees
Figure 2 for Faster Private Minimum Spanning Trees
Figure 3 for Faster Private Minimum Spanning Trees
Figure 4 for Faster Private Minimum Spanning Trees
Viaarxiv icon

PLAN: Variance-Aware Private Mean Estimation

Add code
Jun 17, 2023
Viaarxiv icon

A Smooth Binary Mechanism for Efficient Private Continual Observation

Add code
Jun 16, 2023
Viaarxiv icon

Daisy Bloom Filters

Add code
May 30, 2022
Figure 1 for Daisy Bloom Filters
Viaarxiv icon

Infinitely Divisible Noise in the Low Privacy Regime

Add code
Oct 18, 2021
Figure 1 for Infinitely Divisible Noise in the Low Privacy Regime
Figure 2 for Infinitely Divisible Noise in the Low Privacy Regime
Figure 3 for Infinitely Divisible Noise in the Low Privacy Regime
Figure 4 for Infinitely Divisible Noise in the Low Privacy Regime
Viaarxiv icon

DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search

Add code
Jul 06, 2021
Figure 1 for DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search
Figure 2 for DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search
Figure 3 for DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search
Figure 4 for DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search
Viaarxiv icon

CountSketches, Feature Hashing and the Median of Three

Add code
Feb 03, 2021
Figure 1 for CountSketches, Feature Hashing and the Median of Three
Figure 2 for CountSketches, Feature Hashing and the Median of Three
Figure 3 for CountSketches, Feature Hashing and the Median of Three
Figure 4 for CountSketches, Feature Hashing and the Median of Three
Viaarxiv icon

Sampling a Near Neighbor in High Dimensions -- Who is the Fairest of Them All?

Add code
Jan 26, 2021
Figure 1 for Sampling a Near Neighbor in High Dimensions -- Who is the Fairest of Them All?
Figure 2 for Sampling a Near Neighbor in High Dimensions -- Who is the Fairest of Them All?
Figure 3 for Sampling a Near Neighbor in High Dimensions -- Who is the Fairest of Them All?
Figure 4 for Sampling a Near Neighbor in High Dimensions -- Who is the Fairest of Them All?
Viaarxiv icon

WOR and $p$'s: Sketches for $\ell_p$-Sampling Without Replacement

Add code
Aug 15, 2020
Figure 1 for WOR and $p$'s: Sketches for $\ell_p$-Sampling Without Replacement
Figure 2 for WOR and $p$'s: Sketches for $\ell_p$-Sampling Without Replacement
Viaarxiv icon

Advances and Open Problems in Federated Learning

Add code
Dec 10, 2019
Figure 1 for Advances and Open Problems in Federated Learning
Figure 2 for Advances and Open Problems in Federated Learning
Figure 3 for Advances and Open Problems in Federated Learning
Figure 4 for Advances and Open Problems in Federated Learning
Viaarxiv icon