Sciweavers

3652 search results - page 62 / 731
» A study of query length
Sort
View
TCC
2012
Springer
227views Cryptology» more  TCC 2012»
13 years 10 months ago
Hardness Preserving Constructions of Pseudorandom Functions
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
Abhishek Jain, Krzysztof Pietrzak, Aris Tentes
CIDR
2009
105views Algorithms» more  CIDR 2009»
15 years 4 months ago
Interactive Analysis of Web-Scale Data
We consider how to support interactive querying over webscale data. The basic approach is to view querying as a two-phase activity: first supply a query template, and later supply...
Christopher Olston, Edward Bortnikov, Khaled Elmel...
ECCC
2006
120views more  ECCC 2006»
15 years 3 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
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
DEXA
2006
Springer
113views Database» more  DEXA 2006»
15 years 7 months ago
Dynamic Range Query in Spatial Network Environments
Moving range queries over mobile objects are important in many location management applications. There have been quite a few research works in this area. However, all existing solu...
Fuyu Liu, Tai T. Do, Kien A. Hua
141
Voted
WWW
2008
ACM
16 years 3 months ago
Unsupervised query segmentation using generative language models and wikipedia
In this paper, we propose a novel unsupervised approach to query segmentation, an important task in Web search. We use a generative query model to recover a query's underlyin...
Bin Tan, Fuchun Peng