Sciweavers

5096 search results - page 276 / 1020
» Landscape of Clustering Algorithms
Sort
View
EUROPAR
2004
Springer
15 years 10 months ago
Efficient Parallel Hierarchical Clustering
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...
Manoranjan Dash, Simona Petrutiu, Peter Scheuerman...
JPDC
2007
191views more  JPDC 2007»
15 years 6 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
BILDMED
2011
245views Algorithms» more  BILDMED 2011»
14 years 10 months ago
Clustering-Based Detection of Anatomical Features on Organic Shapes
Abstract. Robust and accurate automatic detection of anatomical features on organic shapes is a challenging task. Despite a rough similarity, each shape is unique. To cope with thi...
Konrad Sickel, Vojtech Bubnik
KAIS
2006
126views more  KAIS 2006»
15 years 6 months ago
Fast and exact out-of-core and distributed k-means clustering
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
Ruoming Jin, Anjan Goswami, Gagan Agrawal
MOBIHOC
2002
ACM
16 years 6 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman