Sciweavers

5096 search results - page 372 / 1020
» Landscape of Clustering Algorithms
Sort
View
IPPS
2005
IEEE
16 years 10 days ago
Message Scheduling for All-to-All Personalized Communication on Ethernet Switched Clusters
We develop a message scheduling scheme that can theoretically achieve the maximum throughput for all–to–all personalized communication (AAPC) on any given Ethernet switched cl...
Ahmad Faraj, Xin Yuan
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
16 years 2 days ago
Clustering Multi-represented Objects with Noise
Abstract. Traditional clustering algorithms are based on one representation space, usually a vector space. However, in a variety of modern applications, multiple representations ex...
Karin Kailing, Hans-Peter Kriegel, Alexey Pryakhin...
DATE
2002
IEEE
82views Hardware» more  DATE 2002»
15 years 11 months ago
Dynamic Scheduling and Clustering in Symbolic Image Computation
The core computation in BDD-based symbolic synthesis and verification is forming the image and pre-image of sets of states under the transition relation characterizing the sequen...
Gianpiero Cabodi, Paolo Camurati, Stefano Quer
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
15 years 11 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
ICPR
2002
IEEE
15 years 11 months ago
A Large Scale Clustering Scheme for Kernel K-Means
Kernel functions can be viewed as a non-linear transformation that increases the separability of the input data by mapping them to a new high dimensional space. The incorporation ...
Rong Zhang, Alexander I. Rudnicky