277 search results - page 53 / 56 » Opportunistic Data Structures for Range Queries |
ADBIS
2007
Springer
14 years 1 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
SIGGRAPH
2000
ACM
13 years 12 months ago
2000
ACM
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...
APBC
2004
13 years 9 months ago
2004
Addressing queries interactively to a chain of two or more biological resources is an everyday task for many scientists, as they use in-silico methods to characterize a biological...
STOC
2010
ACM
13 years 12 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
ICDE
2001
IEEE
14 years 9 months ago
2001
IEEE
Spatial Joins are important and time consuming operations in spatial database management systems. It is crucial to be able to accurately estimate the performance of these operatio...