Sciweavers

79 search results - page 11 / 16
» Applications of Quick-Combine for Ranked Query Models
Sort
View
WWW
2004
ACM
14 years 8 months ago
Best bets: thousands of queries in search of a client
A number of applications require selecting targets for specific contents on the basis of criteria defined by the contents providers rather than selecting documents in response to ...
Giuseppe Attardi, Andrea Esuli, Maria Simi
ACL
2010
13 years 5 months ago
Wikipedia as Sense Inventory to Improve Diversity in Web Search Results
Is it possible to use sense inventories to improve Web search results diversity for one word queries? To answer this question, we focus on two broad-coverage lexical resources of ...
Celina Santamaría, Julio Gonzalo, Javier Ar...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin
ECIR
2003
Springer
13 years 8 months ago
From Uncertain Inference to Probability of Relevance for Advanced IR Applications
Uncertain inference is a probabilistic generalisation of the logical view on databases, ranking documents according to their probabilities that they logically imply the query. For ...
Henrik Nottelmann, Norbert Fuhr
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
14 years 8 days ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...