709 search results - page 71 / 142 » Efficient Evaluation of All-Nearest-Neighbor Queries |
252
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
In uncertain and probabilistic databases, confidence values (or probabilities) are associated with each data item. Confidence values are assigned to query results based on combinin...
161
click to vote
VLDB
2007
ACM
16 years 1 days ago
2007
ACM
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
174
click to vote
WSDM
2010
ACM
16 years 3 months ago
2010
ACM
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
190
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
155
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...