1889 search results - page 153 / 378 » Re-ranking search results using query logs |
175
Voted
PODS
1997
ACM
15 years 4 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
116
Voted
CIKM
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
95
Voted
ESA
2003
Springer
15 years 6 months ago
2003
Springer
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
GCB
1997
Springer
15 years 4 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
111
Voted
WWW
2009
ACM
16 years 1 months ago
2009
ACM
Web search engines are facing formidable performance challenges as they need to process thousands of queries per second over billions of documents. To deal with this heavy workloa...