Sciweavers

329 search results - page 6 / 66
» Automatic Data Locality Optimization Through Self-optimizati...
Sort
View
98
Voted
CEC
2009
IEEE
15 years 6 months ago
A Bacterial Evolutionary Algorithm for automatic data clustering
This paper describes an evolutionary clustering algorithm, which can partition a given dataset automatically into the optimal number of groups through one shot of optimization. The...
Swagatam Das, Archana Chowdhury, Ajith Abraham
DEXAW
2009
IEEE
173views Database» more  DEXAW 2009»
15 years 6 months ago
Automatic Cluster Number Selection Using a Split and Merge K-Means Approach
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
Markus Muhr, Michael Granitzer
ICPP
1998
IEEE
15 years 4 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
INFOCOM
2008
IEEE
15 years 6 months ago
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
Animashree Anandkumar, Lang Tong, Ananthram Swami,...
ICCV
2007
IEEE
15 years 6 months ago
Fast Automatic Heart Chamber Segmentation from 3D CT Data Using Marginal Space Learning and Steerable Features
Multi-chamber heart segmentation is a prerequisite for global quantification of the cardiac function. The complexity of cardiac anatomy, poor contrast, noise or motion artifacts ...
Yefeng Zheng, Adrian Barbu, Bogdan Georgescu, Mich...