Sciweavers

121 search results - page 22 / 25
» Anytime K-Nearest Neighbor Search for Database Applications
Sort
View
ICDE
2005
IEEE
146views Database» more  ICDE 2005»
15 years 5 months ago
Best Effort Query Processing in DHT-based P2P Systems
Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applic...
Philipp Rösch, Kai-Uwe Sattler, Christian von...
CIKM
2009
Springer
15 years 6 months ago
MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching
The problem of measuring similarity between web pages arises in many important Web applications, such as search engines and Web directories. In this paper, we propose a novel neig...
Zhenjiang Lin, Michael R. Lyu, Irwin King
GIS
2004
ACM
16 years 22 days ago
Energy efficient exact kNN search in wireless broadcast environments
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies l...
Bugra Gedik, Aameek Singh, Ling Liu
125
Voted
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
13 years 2 months ago
The long and the short of it: summarising event sequences with serial episodes
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
Nikolaj Tatti, Jilles Vreeken
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 4 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