Sciweavers

616 search results - page 67 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
IV
2009
IEEE
128views Visualization» more  IV 2009»
14 years 2 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber
ISNN
2004
Springer
14 years 1 months ago
A Novel Clustering Analysis Based on PCA and SOMs for Gene Expression Patterns
This paper proposes a novel clustering analysis algorithm based on principal component analysis (PCA) and self-organizing maps (SOMs) for clustering the gene expression patterns. T...
Hong-Qiang Wang, De-Shuang Huang, Xing-Ming Zhao, ...
CCGRID
2010
IEEE
13 years 5 months ago
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
Tatsuhiro Chiba, Mathijs den Burger, Thilo Kielman...
CLUSTER
2007
IEEE
14 years 2 months ago
Network performance model for TCP/IP based cluster computing
— A new communication model, called the PlogPT model, is proposed to predict communication performance in a commodity cluster where computing nodes communicate using TCP/IP. This...
Akihiro Nomura, Hiroya Matsuba, Yutaka Ishikawa
CLUSTER
2009
IEEE
14 years 2 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...