Sciweavers

721 search results - page 58 / 145
» Providing ranked relevant results for web database queries
Sort
View
SIGIR
2008
ACM
13 years 7 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
PET
2009
Springer
14 years 2 months ago
Privacy-Preserving Computation and Verification of Aggregate Queries on Outsourced Databases
: © Privacy-Preserving Computation and Verification of Aggregate Queries on Outsourced Databases Brian Thompson, Stuart Haber, William G. Horne, Tomas Sander, Danfeng Yao HP Labor...
Brian Thompson, Stuart Haber, William G. Horne, To...
INTR
2010
157views more  INTR 2010»
13 years 6 months ago
Classifying the user intent of web queries using k-means clustering
Purpose – Web search engines are frequently used by people to locate information on the Internet. However, not all queries have an informational goal. Instead of information, so...
Ashish Kathuria, Bernard J. Jansen, Carolyn Hafern...
SIGIR
2009
ACM
14 years 14 days ago
Page hunt: improving search engines using human computation games
There has been a lot of work on evaluating and improving the relevance of web search engines. In this paper, we suggest using human computation games to elicit data from players t...
Hao Ma, Raman Chandrasekar, Chris Quirk, Abhishek ...
WEBDB
2010
Springer
168views Database» more  WEBDB 2010»
14 years 27 days ago
WikiAnalytics: Disambiguation of Keyword Search Results on Highly Heterogeneous Structured Data
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
Andrey Balmin, Emiran Curtmola