4438 search results - page 611 / 888 » Speculative Query Processing |
174
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
172
click to vote
SIGIR
2010
ACM
15 years 10 months ago
2010
ACM
Search trails mined from browser or toolbar logs comprise queries and the post-query pages that users visit. Implicit endorsements from many trails can be useful for search result...
173
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
One of the advantages of temporal-logic model-checking tools is their ability to accompany a negative answer to the correctness query by a counterexample to the satisfaction of the...
189
Voted
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
This paper addresses the challenging problem of similarity search over widely distributed ultra-high dimensional data. Such an application is retrieval of the top-k most similar d...
182
click to vote
CLEF
2010
Springer
15 years 7 months ago
2010
Springer
We present our hybrid system for the PAN challenge at CLEF 2010. Our system performs plagiarism detection for translated and non-translated externally as well as intrinsically plag...