Sciweavers

960 search results - page 165 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
139
Voted
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 4 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
141
Voted
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 7 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
109
Voted
KDD
2008
ACM
116views Data Mining» more  KDD 2008»
16 years 4 months ago
Volatile correlation computation: a checkpoint view
Recent years have witnessed increased interest in computing strongly correlated pairs in very large databases. Most previous studies have been focused on static data sets. However...
Wenjun Zhou, Hui Xiong
222
Voted
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
16 years 3 months ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...
115
Voted
IJHPCA
2006
125views more  IJHPCA 2006»
15 years 3 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert