586 search results - page 49 / 118 » Ranking queries on uncertain data |
WWW
2004
ACM
16 years 17 days 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
15 years 5 months 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. ...
164
click to vote
PREMI
2011
Springer
14 years 2 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. ...
195
click to vote
SIGMOD
2009
ACM
16 years 4 days 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
14 years 12 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...