53 search results - page 2 / 11 » On Space Efficient Two Dimensional Range Minimum Data Struct... |
103
Voted
SIGMOD
2002
ACM
15 years 11 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
119
Voted
VLDB
2000
ACM
15 years 3 months ago
2000
ACM
Many emerging application domains require database systems to support efficient access over highly multidimensional datasets. The current state-of-the-art technique to indexing hi...
ICDT
2001
ACM
15 years 4 months 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...
MICS
2010
14 years 10 months ago
2010
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
VLDB
1998
ACM
15 years 3 months ago
1998
ACM
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...