232 search results - page 41 / 47 » Searching for Rare Objects Using Index Replication |
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
VLDB
1999
ACM
14 years 2 days ago
1999
ACM
We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method ...
SIGIR
2010
ACM
13 years 11 months ago
2010
ACM
Diversity has been heavily motivated in the information retrieval literature as an objective criterion for result sets in search and recommender systems. Perhaps one of the most w...
BTW
2007
Springer
13 years 12 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...
ADBIS
2003
Springer
14 years 1 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...