1114 search results - page 187 / 223 » Storage and Data Management in EGEE |
CIKM
2009
Springer
14 years 28 days ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
SIGIR
2010
ACM
14 years 26 days ago
2010
ACM
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
SIGIR
2010
ACM
14 years 26 days ago
2010
ACM
Interleaving experiments are an attractive methodology for evaluating retrieval functions through implicit feedback. Designed as a blind and unbiased test for eliciting a preferen...
CIKM
2006
Springer
14 years 22 days ago
2006
Springer
We consider the problem of evaluating retrieval systems using incomplete judgment information. Buckley and Voorhees recently demonstrated that retrieval systems can be efficiently...
CIKM
2006
Springer
14 years 22 days 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 ...