This paper studies the ε-approximate range emptiness problem, where the task is to represent a set S of n points from {0,..., U − 1} and answer emptiness queries of the form “[a; b] ∩ S 6 = ∅? ” with a probability of false positives allowed. This generalizes the functionality of Bloom filters from single point queries to any interval length L. Setting the false positive rate to ε/L and performing L queries, Bloom filters yield a solution to this problem with space O(n lg(L/ε)) bits, false positive probability bounded by ε for intervals of length up to L, using query time O(L lg(L/ε)). Our first contribution is to show that the space/error trade-off cannot be improved asymptotically: Any data structure for answering approximate range empti...
A problem arising in statistical data analysis and pattern recognition is to find a longest interval...
A Bloom filter is a very compact data structure that supports approximate membership queries on a se...
We show how any BSP tree for the endpoints of a set of n disjoint segments in the plane can be used ...
This paper studies the \emph{$\varepsilon$-approximate range emptiness} problem, where the task is t...
This thesis deals with the design of data structures for the approximate range emptiness problem, wh...
The approximate range emptiness problem requires a memory-efficient data structure D to approximatel...
For any epsilon in (0,1), a (1+epsilon)-approximate range mode query asks for the position of an ele...
The range searching problem is a fundamental problem in computational geometry, with numerous import...
Abstract. We revisit the range minimum query problem and present a new O(n)-space data structure tha...
We present space-time tradeoffs for approximate spherical range counting queries. Given a set S of n...
We present space-time tradeoffs for approximate spherical range counting queries. Given a set S of n...
In this paper, we study the maximum density, threshold and emptiness queries for intervals in the s...
For any epsilon in (0,1), a (1+epsilon)-approximate range mode query asks for the position of an ele...
We improve the previous results by Aronov and Har-Peled (SODA’05) and Kaplan and Sharir (SODA’06) an...
AbstractApplying standard dimensionality reduction techniques, we show how to perform approximate ra...
A problem arising in statistical data analysis and pattern recognition is to find a longest interval...
A Bloom filter is a very compact data structure that supports approximate membership queries on a se...
We show how any BSP tree for the endpoints of a set of n disjoint segments in the plane can be used ...
This paper studies the \emph{$\varepsilon$-approximate range emptiness} problem, where the task is t...
This thesis deals with the design of data structures for the approximate range emptiness problem, wh...
The approximate range emptiness problem requires a memory-efficient data structure D to approximatel...
For any epsilon in (0,1), a (1+epsilon)-approximate range mode query asks for the position of an ele...
The range searching problem is a fundamental problem in computational geometry, with numerous import...
Abstract. We revisit the range minimum query problem and present a new O(n)-space data structure tha...
We present space-time tradeoffs for approximate spherical range counting queries. Given a set S of n...
We present space-time tradeoffs for approximate spherical range counting queries. Given a set S of n...
In this paper, we study the maximum density, threshold and emptiness queries for intervals in the s...
For any epsilon in (0,1), a (1+epsilon)-approximate range mode query asks for the position of an ele...
We improve the previous results by Aronov and Har-Peled (SODA’05) and Kaplan and Sharir (SODA’06) an...
AbstractApplying standard dimensionality reduction techniques, we show how to perform approximate ra...
A problem arising in statistical data analysis and pattern recognition is to find a longest interval...
A Bloom filter is a very compact data structure that supports approximate membership queries on a se...
We show how any BSP tree for the endpoints of a set of n disjoint segments in the plane can be used ...