arXiv (All)
open access
Geometric Hashing in MPC with Applications to Clustering and Stochastic Embeddings
In this paper we study consistent hashing (a.k.a. sparse partitions) for doubling metrics in the Massively Parallel Computation (MPC) model. A $(Γ,Λ)$-hash with diameter bound $Δ$ partitions a metric space into clusters of diameter at most $Δ$ such that every ball of radius $Δ/Γ$ intersects at most
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bounded Independence for $k$-Min-Wise Hashing: Tight Bounds and Limitations of Structured Hashing#974510
- The Erdős similarity problem for null sequences with adjacent ratios bounded below#1248729
- Limited Independence Suffices for Large-k Min-wise Hashing#984191
- Zipf’s law, Heaps’ law, and beyond#68978
- Estimating Peer Similarity using Distance of Shared Files#168213
Record · ID 1356707
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive