Sciweavers

15254 search results - page 44 / 3051
» A k
Sort
View
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
14 years 11 months ago
Comparing top k lists
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
Ronald Fagin, Ravi Kumar, D. Sivakumar
VLDB
2009
ACM
381views Database» more  VLDB 2009»
15 years 9 months ago
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive...
Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei...
DC
2008
14 years 9 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
DATAMINE
2006
230views more  DATAMINE 2006»
14 years 9 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
GEOINFORMATICA
2006
133views more  GEOINFORMATICA 2006»
14 years 9 months ago
Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks
With the rapid advancements in positioning technologies such as the Global Positioning System (GPS) and wireless communications, the tracking of continuously moving objects has bec...
Dan Lin, Rui Zhang 0003, Aoying Zhou