164 search results - page 11 / 33 » Reverse Top-k Queries |
WSDM
2009
ACM
14 years 3 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 8 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...
ICDE
2011
IEEE
13 years 5 days ago
2011
IEEE
Given a set of objects and a query q, a point p is
called the reverse k nearest neighbor (RkNN) of q if q is one of
the k closest objects of p. In this paper, we introduce the c...
PETRA
2010
ACM
13 years 10 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 8 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 ...