Sciweavers

960 search results - page 35 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
138
Voted
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
16 years 4 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
162
Voted
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
15 years 8 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
133
Voted
WWW
2005
ACM
16 years 4 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
124
Voted
FMSD
2006
85views more  FMSD 2006»
15 years 3 months ago
Distributed disk-based algorithms for model checking very large Markov chains
In this paper we present data structures and distributed algorithms for CSL model checking-based performance and dependability evaluation. We show that all the necessary computatio...
Alexander Bell, Boudewijn R. Haverkort
145
Voted
BMCBI
2006
144views more  BMCBI 2006»
15 years 3 months ago
Development and implementation of an algorithm for detection of protein complexes in large interaction networks
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...
Md. Altaf-Ul-Amin, Yoko Shinbo, Kenji Mihara, Ken ...