102 search results - page 5 / 21 » Data Structures for Reporting Extension Violations in a Quer... |
105
click to vote
SPIRE
2005
Springer
15 years 8 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
123
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
161
click to vote
ICDE
2006
IEEE
15 years 9 months ago
2006
IEEE
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
107
click to vote
CCCG
2008
15 years 4 months ago
2008
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
200
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...