5344 search results - page 689 / 1069 » Privacy-Preserving Set Operations |
298
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
276
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
Modern applications are designed in multiple tiers to separate concerns. Since each tier may run at a separate location, middleware is required to mediate access between tiers. Ho...
326
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
210
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
169
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...