164 search results - page 17 / 33 » Reverse Top-k Queries |
168
click to vote
EDBT
2011
ACM
14 years 9 months ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
178
click to vote
BTW
2007
Springer
15 years 9 months ago
2007
Springer
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
141
click to vote
VLDB
2001
ACM
15 years 10 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
160
click to vote
CIKM
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
153
click to vote
NIPS
2004
15 years 7 months ago
2004
High retrieval precision in content-based image retrieval can be attained by adopting relevance feedback mechanisms. These mechanisms require that the user judges the quality of t...