49 search results - page 7 / 10 » Two-Dimensional Range Minimum Queries |
TIME
2000
IEEE
13 years 12 months ago
2000
IEEE
In spatiotemporal applications, meaningful changes vary according to object type, level of detail, and nature of application. In this paper, we introduce a dynamic classification ...
GIS
2005
ACM
14 years 8 months ago
2005
ACM
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
VLDB
2004
ACM
14 years 7 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
DCC
2010
IEEE
14 years 2 months ago
2010
IEEE
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...