806 search results - page 96 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
110
click to vote
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
While provenance has been extensively studied in the literature, the efficient evaluation of provenance queries remains an open problem. Traditional query optimization techniques...
249
click to vote
ICDE
1996
IEEE
16 years 2 months ago
1996
IEEE
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
193
click to vote
ACMSE
2007
ACM
15 years 5 months ago
2007
ACM
Classification and change detection of land cover types in the remotely sensed images is one of the major applications in remote sensing. This paper presents a hierarchical framew...
107
click to vote
PODS
2006
ACM
16 years 1 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...
192
click to vote
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...