210 search results - page 16 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
COMPGEOM
2011
ACM
13 years 5 days 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...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
EDBT
2009
ACM
14 years 14 days ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
IGIS
1994
14 years 21 days ago
1994
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
PODS
1995
ACM
14 years 4 days ago
1995
ACM
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...