Pages that link to "Item:Q5902137"

The following pages link to On approximate range counting and depth (Q5902137):

Displaying 16 items.

• Approximating majority depth (Q364853) (← links)
• Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
• Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
• The overlay of minimization diagrams in a randomized incremental construction (Q633216) (← links)
• Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints (Q840817) (← links)
• A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
• Exact computation of the halfspace depth (Q1659242) (← links)
• Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os (Q1741853) (← links)
• Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications (Q2207601) (← links)
• Approximate range searching: The absolute model (Q2269144) (← links)
• On approximating the depth and related problems (Q2921754) (← links)
• Resolving SINR Queries in a Dynamic Setting (Q3387759) (← links)
• Approximate range counting revisited (Q4958384) (← links)
• A new approach for the computation of halfspace depth in high dimensions (Q5086196) (← links)
• (Q5111686) (← links)
• A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension (Q5743609) (← links)