73 search results - page 13 / 15 » Data Structures for Range Minimum Queries in Multidimensiona... |
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
ions Sriram Krishnamoorthy½ Umit Catalyurek¾ Jarek Nieplocha¿ Atanas Rountev½ P. Sadayappan½ ½ Dept. of Computer Science and Engineering, ¾ Dept. of Biomedical Informatics T...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
BIBE
2003
IEEE
14 years 27 days ago
2003
IEEE
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
ICMCS
1999
IEEE
13 years 12 months ago
1999
IEEE
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...