806 search results - page 17 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
ICDT
2001
ACM
14 years 2 days ago
2001
ACM
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
SIGMOD
2000
ACM
13 years 12 months ago
2000
ACM
Continuous queries are persistent queries that allow users to receive new results when they become available. While continuous query systems can transform a passive web into an ac...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
EDBTW
2010
Springer
13 years 11 months ago
2010
Springer
Successfully structuring information in databases, OLAP cubes, and XML is a crucial element in managing data nowadays. However this process brought new challenges to usability. It...
COMPGEOM
2011
ACM
12 years 11 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...