Sciweavers

1626 search results - page 167 / 326
» Spatial-Scene Similarity Queries
Sort
View
CLEF
2003
Springer
15 years 9 months ago
Merging Results by Predicted Retrieval Effectiveness
In this paper we propose several merging strategies to integrate the result lists of each intermediate run in distributed MLIR. The prediction of retrieval effectiveness was used t...
Wen-Cheng Lin, Hsin-Hsi Chen
ALENEX
2001
89views Algorithms» more  ALENEX 2001»
15 years 6 months ago
Estimating Resemblance of MIDI Documents
Abstract. Search engines often employ techniques for determining syntactic similarity of Web pages. Such a tool allows them to avoid returning multiple copies of essentially the sa...
Michael Mitzenmacher, Sean Owen
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 6 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
16 years 4 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
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...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
ICASSP
2009
IEEE
15 years 11 months ago
Fingerprint matching based on distance metric learning
This paper considers a method for learning a distance metric in a fingerprinting system which identifies a query content by measuring the distance between the fingerprint of th...
Dalwon Jang, Chang D. Yoo