Sciweavers

1088 search results - page 59 / 218
» Probabilistic query expansion using query logs
Sort
View
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
14 years 10 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
ICALP
2009
Springer
14 years 10 months ago
Towards Optimal Range Medians
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
Beat Gfeller, Peter Sanders
ICML
2008
IEEE
14 years 11 months ago
Learning to learn implicit queries from gaze patterns
In the absence of explicit queries, an alternative is to try to infer users' interests from implicit feedback signals, such as clickstreams or eye tracking. The interests, fo...
Antti Ajanki, Kai Puolamäki, Samuel Kaski
CIKM
2011
Springer
12 years 10 months ago
Improved answer ranking in social question-answering portals
Community QA portals provide an important resource for non-factoid question-answering. The inherent noisiness of user-generated data makes the identification of high-quality cont...
Felix Hieber, Stefan Riezler
APPT
2005
Springer
14 years 8 days ago
Probabilistic Continuous Update Scheme in Location Dependent Continuous Queries
It is difficult to maintain the exact location of mobile objects due to the limited resources in a mobile network. A consequence of this problem is that the update cost for a locat...
Song Han, Edward Chan