π
π
The Cartographer
Simple Analysis of Priority Sampling
August 11, 2023 Β· Declared Dead Β· π SIAM Symposium on Simplicity in Algorithms
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Majid Daliri, Juliana Freire, Christopher Musco, AΓ©cio Santos, Haoxiang Zhang
arXiv ID
2308.05907
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DB
Citations
2
Venue
SIAM Symposium on Simplicity in Algorithms
Last Checked
4 months ago
Abstract
We prove a tight upper bound on the variance of the priority sampling method (aka sequential Poisson sampling). Our proof is significantly shorter and simpler than the original proof given by Mario Szegedy at STOC 2006, which resolved a conjecture by Duffield, Lund, and Thorup.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted