Image de couverture de livre

An adversarially robust data-market for spatial, crowd-sourced data

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kharman, Aida Manzano, Jursitzky, Christian, Zhou, Quan, Ferraro, Pietro, Marecek, Jakub, Pinson, Pierre, Shorten, Robert
Format:	Preprint
Publié:	2022
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Tree Proof-of-Position Algorithms
par: Kharman, Aida Manzano, et autres
Publié: (2024)

On the adversarial robustness of Locality-Sensitive Hashing in Hamming space
par: Kapralov, Michael, et autres
Publié: (2024)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
par: Borst, Sander, et autres
Publié: (2024)

Twin-Width Meets Feedback Edges and Vertex Integrity
par: Balabán, Jakub, et autres
Publié: (2024)

Finding $b$-colorings Using Feedback Edges
par: Balabán, Jakub
Publié: (2025)

Speed-robust scheduling revisited
par: Minařík, Josef, et autres
Publié: (2024)

A fast and slightly robust covariance estimator
par: Duchi, John, et autres
Publié: (2025)

Computing String Covers in Sublinear Time
par: Radoszewski, Jakub, et autres
Publié: (2024)

Space-Efficient k-Mismatch Text Indexes
par: Kociumaka, Tomasz, et autres
Publié: (2025)

Probabilistic analysis of arithmetic coding showing its robustness
par: Mahmoud, Hosam M., et autres
Publié: (2025)

Dynamic data summarization for hierarchical spatial clustering
par: Abduaziz, Kayumov, et autres
Publié: (2024)

Better space-time-robustness trade-offs for set reconciliation
par: Belazzougui, Djamal, et autres
Publié: (2024)

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time
par: Mahabadi, Sepideh, et autres
Publié: (2025)

Fast Computation of $k$-Runs, Parameterized Squares, and Other Generalised Squares
par: Nakashima, Yuto, et autres
Publié: (2025)

Improved Algorithms for Fair Matroid Submodular Maximization
par: Mahabadi, Sepideh, et autres
Publié: (2026)

Recoverable robust shortest path problem under interval budgeted uncertainty representations
par: Jackiewicz, Marcel, et autres
Publié: (2024)

Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale: a self-calibrated randomized solution
par: Wu, Changye, et autres
Publié: (2018)

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
par: Lebeda, Christian Janos, et autres
Publié: (2024)

Median and Small Parsimony Problems on RNA trees
par: Marchand, Bertrand, et autres
Publié: (2024)

A Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
par: Cenciarelli, Pietro, et autres
Publié: (2016)

Sublinear Metric Steiner Forest via Maximal Independent Set
par: Mahabadi, Sepideh, et autres
Publié: (2025)

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
par: Mahabadi, Sepideh, et autres
Publié: (2024)

Online Steiner Forest with Recourse
par: Long, Yaowei, et autres
Publié: (2026)

Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation
par: Narayanan, Shyam, et autres
Publié: (2024)

DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering
par: Yu, Shangdi, et autres
Publié: (2025)

On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs
par: Aminian, Aida, et autres
Publié: (2025)

Dynamic data structures for twin-ordered matrices
par: Bosek, Bartłomiej, et autres
Publié: (2026)

Parameterized dynamic data structure for Split Completion
par: Majewski, Konrad, et autres
Publié: (2024)

A data structure for monomial ideals with applications to signature Gröbner bases
par: Lairez, Pierre, et autres
Publié: (2026)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
par: Łącki, Jakub, et autres
Publié: (2025)

Faster Algorithms for Longest Common Substring
par: Charalampopoulos, Panagiotis, et autres
Publié: (2021)

Sparse Random Matrices for Dimensionality Reduction
par: Mackenzie, Pierre
Publié: (2025)

Approximating Dasgupta Cost in Sublinear Time from a Few Random Seeds
par: Kapralov, Michael, et autres
Publié: (2022)

Online Knapsack Problems with Estimates
par: Balabán, Jakub, et autres
Publié: (2025)

Dynamic PageRank: Algorithms and Lower Bounds
par: Jayaram, Rajesh, et autres
Publié: (2024)

glass: ordered set data structure for client-side order books
par: Krapivensky, Viktor
Publié: (2025)

Reconfiguration Using Generalized Token Jumping
par: Křišťan, Jan Matyáš, et autres
Publié: (2024)

Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
par: Velusamy, Santhoshini, et autres
Publié: (2025)

Massively Parallel Minimum Spanning Tree in General Metric Spaces
par: Azarmehr, Amir, et autres
Publié: (2024)

Counting Distinct Square Substrings in Sublinear Time
par: Charalampopoulos, Panagiotis, et autres
Publié: (2025)