1342 search results - page 79 / 269 » Descriptor Learning for Efficient Retrieval |
134
Voted
DAGSTUHL
2004
15 years 4 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
131
Voted
HPDC
2010
IEEE
15 years 4 months ago
2010
IEEE
Current projects that automate the collection of provenance information use a centralized architecture for managing the resulting metadata - that is, provenance is gathered at rem...
229
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
143
Voted
KDD
2000
ACM
15 years 7 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
152
Voted
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
Search nodes are single-purpose components of large Web search engines and their efficient implementation is critical to sustain thousands of queries per second and guarantee indi...