scientific article; zbMATH DE number 7278047
From MaRDI portal
Publication:5136262
Recommendations
- Fast cross-polytope locality-sensitive hashing
- A fast direct sampling algorithm for equilateral closed polygons
- Efficient L₀ resampling of point sets
- Parameter-free locality sensitive hashing for spherical range reporting
- Sampling spaces of thick polygons
- Pattern hit-and-run for sampling efficiently on polytopes
- Fast range searching with Delaunay triangulations
- Simple and efficient distribution-sensitive point location in triangulations
- An empirical study on randomized optimal area polygonization of planar point sets
Cites work
- A small approximately min-wise independent family of hash functions
- Approximate range searching
- Approximately minwise independence with twisted tabulation
- 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
- Bottom-k and priority sampling, set similarity and subset sums with minimal independence
- Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?
- New Upper Bounds in Klee’s Measure Problem
- Range‐Efficient Counting of Distinct Elements in a Massive Data Stream
- Size-estimation framework with applications to transitive closure and reachability
- Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints
- Stable snap rounding
- Summarizing data using bottom-k sketches
- The measure problem for rectangular ranges in d-space
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136262)
