Sciweavers

1088 search results - page 106 / 218
» Probabilistic query expansion using query logs
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 9 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
LREC
2008
193views Education» more  LREC 2008»
13 years 10 months ago
Automated Subject Induction from Query Keywords through Wikipedia Categories and Subject Headings
This paper addresses a novel approach that integrates two different types of information resources: the World Wide Web and libraries. This approach is based on a hypothesis: advan...
Yoji Kiyota, Noriyuki Tamura, Satoshi Sakai, Hiros...
ICDE
2004
IEEE
94views Database» more  ICDE 2004»
14 years 10 months ago
A Probabilistic Approach to Metasearching with Adaptive Probing
An ever increasing amount of valuable information is stored in Web databases, "hidden" behind search interfaces. To save the user's effort in manually exploring eac...
Zhenyu Liu, Chang Luo, Junghoo Cho, Wesley W. Chu
AUSDM
2007
Springer
107views Data Mining» more  AUSDM 2007»
14 years 3 months ago
Preference Networks: Probabilistic Models for Recommendation Systems
Recommender systems are important to help users select relevant and personalised information over massive amounts of data available. We propose an unified framework called Prefer...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh
SCCC
1997
IEEE
14 years 1 months ago
Reactive Ranking for Cooperative Databases
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
Berthier A. Ribeiro-Neto, Guilherme T. de Assis