Sciweavers

3652 search results - page 45 / 731
» A study of query length
Sort
View
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
14 years 3 days ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
CEAS
2005
Springer
14 years 1 months ago
Implicit Queries for Email
Implicit query systems examine a document and automatically conduct searches for the most relevant information. In this paper, we offer three contributions to implicit query resea...
Joshua Goodman, Vitor R. Carvalho
SEBD
1996
94views Database» more  SEBD 1996»
13 years 9 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
JCDL
2006
ACM
71views Education» more  JCDL 2006»
14 years 1 months ago
Using controlled query generation to evaluate blind relevance feedback algorithms
Currently in document retrieval there are many algorithms each with different strengths and weakness. There is some difficulty, however, in evaluating the impact of the test quer...
Chris Jordan, Carolyn R. Watters, Qigang Gao
STACS
2010
Springer
14 years 2 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf