586 search results - page 49 / 118 » Ranking queries on uncertain data |
WWW
2004
ACM
14 years 8 months ago
2004
ACM
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
XSYM
2004
Springer
14 years 29 days ago
2004
Springer
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
PREMI
2011
Springer
12 years 10 months ago
2011
Springer
This paper presents a potential seed selection algorithm for web crawlers using a gain - share scoring approach. Initially we consider a set of arbitrarily chosen tourism queries. ...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
DEBU
2010
13 years 7 months ago
2010
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...