8972 search results - page 1749 / 1795 » Private Information Retrieval |
86
Voted
STOC
2005
ACM
15 years 11 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
189
Voted
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
148
click to vote
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharin...
148
Voted
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
164
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...