Sciweavers

1088 search results - page 30 / 218
» Probabilistic query expansion using query logs
Sort
View
ECCC
2010
140views more  ECCC 2010»
14 years 10 months ago
Query-Efficient Locally Decodable Codes
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
WWW
2007
ACM
16 years 3 months ago
Determining the user intent of web search engine queries
Determining the user intent of Web searches is a difficult problem due to the sparse data available concerning the searcher. In this paper, we examine a method to determine the us...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink
CORR
2010
Springer
230views Education» more  CORR 2010»
14 years 11 months ago
Query-Efficient Locally Decodable Codes of Subexponential Length
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
SIGIR
2005
ACM
15 years 8 months ago
Probabilistic hyperspace analogue to language
Song and Bruza [6] introduce a framework for Information Retrieval(IR) based on Gardenfor’s three tiered cognitive model; Conceptual Spaces[4]. They instantiate a conceptual spa...
Leif Azzopardi, Mark Girolami, Malcolm Crowe
SIGIR
2008
ACM
15 years 2 months ago
Predicting when browsing context is relevant to search
We investigate a representative case of sudden information need change of Web users. By analyzing search engine query logs, we show that the majority of queries submitted by users...
Mandar Rahurkar, Silviu Cucerzan