242 search results - page 23 / 49 » Fast Indexes and Algorithms for Set Similarity Selection Que... |
ERCIMDL
1999
Springer
13 years 11 months ago
1999
Springer
Resource discovery in a distributed digital library poses many challenges, one of which is how to choose search engines for query distribution, given a query and a set of search e...
ICDE
2000
IEEE
14 years 8 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Due to the rapid growth in the size of the web, web search engines are facing enormous performance challenges. The larger engines in particular have to be able to process tens of ...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
CLEF
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents Wolverhampton University's participation in the WiQA competition. The method chosen for this task combines a high precision, but low recall information re...