A Model for Donation Verification
August 26, 2017 Β· Declared Dead Β· π ACM Southeast Regional Conference
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Bin Fu, Fengjuan Zhu, John Abraham
arXiv ID
1708.07973
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CY
Citations
1
Venue
ACM Southeast Regional Conference
Last Checked
4 months ago
Abstract
In this paper, we introduce a model for donation verification. A randomized algorithm is developed to check if the money claimed being received by the collector is $(1-Ξ΅)$-approximation to the total amount money contributed by the donors. We also derive some negative results that show it is impossible to verify the donations under some circumstances.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
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