Sciweavers

1661 search results - page 2 / 333
» Distributed Top-K Monitoring
Sort
View
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
13 years 9 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
CIKM
2011
Springer
12 years 4 months ago
S3K: seeking statement-supporting top-K witnesses
Traditional information retrieval techniques based on keyword search help to identify a ranked set of relevant documents, which often contains many documents in the top ranks that...
Steffen Metzger, Shady Elbassuoni, Katja Hose, Ral...
CIKM
2006
Springer
13 years 8 months ago
Distributed spatio-temporal similarity search
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 ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...
INFOCOM
2007
IEEE
13 years 11 months ago
Optimizing File Availability in Peer-to-Peer Content Distribution
Abstract— A fundamental paradigm in peer-to-peer (P2P) content distribution is that of a large community of intermittentlyconnected nodes that cooperate to share files. Because ...
Jussi Kangasharju, Keith W. Ross, David A. Turner
ICTIR
2009
Springer
13 years 2 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette