Sciweavers

1088 search results - page 43 / 218
» Probabilistic query expansion using query logs
Sort
View
WWW
2004
ACM
14 years 11 months ago
Providing ranked relevant results for web database queries
Often Web database users experience difficulty in articulating their needs using a precise query. Providing ranked set of possible answers would benefit such users. We propose to ...
Ullas Nambiar, Subbarao Kambhampati
ACL
2009
13 years 8 months ago
Learning Semantic Categories from Clickthrough Logs
As the web grows larger, knowledge acquisition from the web has gained increasing attention. In this paper, we propose using web search clickthrough logs to learn semantic categor...
Mamoru Komachi, Shimpei Makimoto, Kei Uchiumi, Man...
EMNLP
2006
13 years 11 months ago
Context-Dependent Term Relations for Information Retrieval
Co-occurrence analysis has been used to determine related words or terms in many NLP-related applications such as query expansion in Information Retrieval (IR). However, related w...
Jing Bai, Jian-Yun Nie, Guihong Cao
FOCS
1992
IEEE
14 years 1 months ago
Proof Verification and Hardness of Approximation Problems
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...
PVLDB
2010
110views more  PVLDB 2010»
13 years 8 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor