Sciweavers

137 search results - page 14 / 28
» Clustering in Trees: Optimizing Cluster Sizes and Number of ...
Sort
View
MICS
2010
134views more  MICS 2010»
13 years 5 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
ICMCS
2006
IEEE
105views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Entropy and Memory Constrained Vector Quantization with Separability Based Feature Selection
An iterative model selection algorithm is proposed. The algorithm seeks relevant features and an optimal number of codewords (or codebook size) as part of the optimization. We use...
Sangho Yoon, Robert M. Gray
IPPS
2009
IEEE
14 years 2 months ago
Designing multi-leader-based Allgather algorithms for multi-core clusters
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
Krishna Chaitanya Kandalla, Hari Subramoni, Gopala...
PDCN
2004
13 years 8 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
ICC
2008
IEEE
112views Communications» more  ICC 2008»
14 years 1 months ago
Throughput Optimization for Hierarchical Cooperation in Ad Hoc Networks
—For a wireless network with ¢ nodes distributed in an area £ , with ¢ source-destination pairs communicating with each other at some common rate, the hierarchical cooperation...
Javad Ghaderi, Liang-Liang Xie, Xuemin Shen