scientific article; zbMATH DE number 7278047

DOI10.4230/LIPIcs.ISAAC.2017.42zbMath1457.68078arXiv1701.05290MaRDI QIDQ5136262

Rasmus Pagh, Joachim Gudmundsson

Publication date: 25 November 2020

Full work available at URL: https://arxiv.org/abs/1701.05290

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

probability distributionpolygonconsistent samplinglocality-sensitive hashingMIN-wise hashing

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Cites Work

• Approximating a real number by a rational number with a limited denominator: a geometric approach
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• Size-estimation framework with applications to transitive closure and reachability
• Approximate range searching
• Stable snap rounding
• A Small Approximately Min-Wise Independent Family of Hash Functions
• Approximately Minwise Independence with Twisted Tabulation
• Can the Measure of ∪ n 1 [ a i , b i be Computed in Less Than O(n logn) Steps?]
• The measure problem for rectangular ranges in d-space
• New Upper Bounds in Klee’s Measure Problem
• Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
• Summarizing data using bottom-k sketches
• Bottom-k and priority sampling, set similarity and subset sums with minimal independence