Sciweavers

404 search results - page 4 / 81
» Query length in interactive information retrieval
Sort
View
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 8 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
ICTAI
2007
IEEE
14 years 1 months ago
Document Length Normalization by Statistical Regression
The document-length normalization problem has been widely studied in the field of Information Retrieval. The Cosine Normalization [2], the Maximum tf Normalization [1] and the By...
Sylvain Lamprier, Tassadit Amghar, Bernard Levrat,...
CIKM
2008
Springer
13 years 9 months ago
Ranking information resources in peer-to-peer text retrieval: an experimental study
This paper experimentally studies approaches to the problem of ranking information resources w.r.t. user queries in peer-to-peer information retrieval. In distributed environments...
Hans F. Witschel
ECIR
2008
Springer
13 years 9 months ago
Probabilistic Document Length Priors for Language Models
This paper addresses the issue of devising a new document prior for the language modeling (LM) approach for Information Retrieval. The prior is based on term statistics, derived in...
Roi Blanco, Alvaro Barreiro
IR
2008
13 years 7 months ago
An analysis on document length retrieval trends in language modeling smoothing
Abstract. Document length is widely recognized as an important factor for adjusting retrieval systems. Many models tend to favor the retrieval of either short or long documents and...
David E. Losada, Leif Azzopardi