Picture for Rasmus Pagh

Rasmus Pagh

Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation

Add code
Dec 13, 2024
Figure 1 for Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
Figure 2 for Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
Figure 3 for Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
Figure 4 for Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
Viaarxiv icon

Streaming Private Continual Counting via Binning

Add code
Dec 10, 2024
Figure 1 for Streaming Private Continual Counting via Binning
Figure 2 for Streaming Private Continual Counting via Binning
Figure 3 for Streaming Private Continual Counting via Binning
Figure 4 for Streaming Private Continual Counting via Binning
Viaarxiv icon

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
Figure 1 for PLAN: Variance-Aware Private Mean Estimation
Figure 2 for PLAN: Variance-Aware Private Mean Estimation
Figure 3 for PLAN: Variance-Aware Private Mean Estimation
Figure 4 for PLAN: Variance-Aware Private Mean Estimation
Viaarxiv icon

A Smooth Binary Mechanism for Efficient Private Continual Observation

Add code
Jun 16, 2023
Figure 1 for A Smooth Binary Mechanism for Efficient Private Continual Observation
Figure 2 for A Smooth Binary Mechanism for Efficient Private Continual Observation
Figure 3 for A Smooth Binary Mechanism for Efficient Private Continual Observation
Figure 4 for A Smooth Binary Mechanism for Efficient Private Continual Observation
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