Sciweavers

147 search results - page 18 / 30
» Optimization and Simplification of Hierarchical Clusterings
Sort
View
IMSCCS
2007
IEEE
14 years 2 months ago
A Mobile Ad Hoc Network with Mobile Satellite Earth-stations
Ad hoc networks face the problem of improving networks’ capacity and scalability. The scalability problem can be properly solved through physical hierarchy networking. In this p...
Song Han, Guochang Gu, Jun Ni
BMCBI
2008
138views more  BMCBI 2008»
13 years 8 months ago
Methods for simultaneously identifying coherent local clusters with smooth global patterns in gene expression profiles
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
Yin-Jing Tien, Yun-Shien Lee, Han-Ming Wu, Chun-Ho...
IPPS
2009
IEEE
14 years 3 months ago
High-order stencil computations on multicore clusters
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
Liu Peng, Richard Seymour, Ken-ichi Nomura, Rajiv ...
BMCBI
2007
146views more  BMCBI 2007»
13 years 8 months ago
Bayesian hierarchical model for transcriptional module discovery by jointly modeling gene expression and ChIP-chip data
Background: Transcriptional modules (TM) consist of groups of co-regulated genes and transcription factors (TF) regulating their expression. Two high-throughput (HT) experimental ...
Xiangdong Liu, Walter J. Jessen, Siva Sivaganesan,...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 3 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl