116 search results - page 17 / 24 » Privacy-Preserving Top-K Queries |
WSDM
2009
ACM
14 years 4 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
CCR
2006
13 years 9 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
PETRA
2010
ACM
13 years 11 months ago
2010
ACM
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of mus...
CCS
2011
ACM
12 years 9 months ago
2011
ACM
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
CCS
2007
ACM
14 years 3 months ago
2007
ACM
A Distributed Information Brokering System (DIBS) is a peer-to-peer overlay network that comprises diverse data servers and brokering components helping client queries locate the ...