Sciweavers

845 search results - page 50 / 169
» Adaptive K-Means Clustering
Sort
View
CGF
2010
171views more  CGF 2010»
14 years 6 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
ICAC
2007
IEEE
15 years 4 months ago
Adaptive Learning of Metric Correlations for Temperature-Aware Database Provisioning
This paper introduces a transparent self-configuring architecture for automatic scaling with temperature awareness in the database tier of a dynamic content web server. We use a ...
Saeed Ghanbari, Gokul Soundararajan, Jin Chen, Cri...
WOWMOM
2006
ACM
120views Multimedia» more  WOWMOM 2006»
15 years 3 months ago
Self-Sizing of Clustered Databases
Distributed software environments are increasingly difficult to manage. This paper presents a middleware for the development of self-manageable and autonomic systems. Preliminary ...
Christophe Taton, Sara Bouchenak, Noel De Palma, D...
SC
2003
ACM
15 years 3 months ago
Optimizing 10-Gigabit Ethernet for Networks of Workstations, Clusters, and Grids: A Case Study
This paper presents a case study of the 10-Gigabit Ethernet (10GbE) adapter from Intel R . Specifically, with appropriate optimizations to the configurations of the 10GbE adapte...
Wu-chun Feng, Justin Gus Hurwitz, Harvey B. Newman...
MLDM
2007
Springer
15 years 3 months ago
Kernel MDL to Determine the Number of Clusters
In this paper we propose a new criterion, based on Minimum Description Length (MDL), to estimate an optimal number of clusters. This criterion, called Kernel MDL (KMDL), is particu...
Ivan O. Kyrgyzov, Olexiy O. Kyrgyzov, Henri Ma&ici...