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...
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...
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...
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...
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...