Sciweavers

826 search results - page 165 / 166
» Query Performance Prediction: Evaluation Contrasted with Eff...
Sort
View
SIGIR
2008
ACM
13 years 5 months ago
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
Efficient similarity search in high-dimensional spaces is important to content-based retrieval systems. Recent studies have shown that sketches can effectively approximate L1 dist...
Wei Dong, Moses Charikar, Kai Li
SIGIR
2012
ACM
11 years 8 months ago
Content-based retrieval for heterogeneous domains: domain adaptation by relative aggregation points
We introduce the problem of domain adaptation for content-based retrieval and propose a domain adaptation method based on relative aggregation points (RAPs). Content-based retriev...
Makoto P. Kato, Hiroaki Ohshima, Katsumi Tanaka
WWW
2002
ACM
14 years 6 months ago
Expert agreement and content based reranking in a meta search environment using Mearf
Recent increase in the number of search engines on the Web and the availability of meta search engines that can query multiple search engines makes it important to find effective ...
B. Uygar Oztekin, George Karypis, Vipin Kumar
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 5 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
EDBT
2010
ACM
181views Database» more  EDBT 2010»
13 years 4 months ago
Private record matching using differential privacy
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
Ali Inan, Murat Kantarcioglu, Gabriel Ghinita, Eli...