125 search results - page 11 / 25 » Controllable and Progressive Edge Clustering for Large Netwo... |
CLUSTER
2000
IEEE
13 years 11 months ago
2000
IEEE
To construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switc...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
BMCBI
2005
13 years 7 months ago
2005
Background: Protein-protein association is essential for a variety of cellular processes and hence a large number of investigations are being carried out to understand the princip...
ICPADS
2007
IEEE
14 years 1 months ago
2007
IEEE
- Due to the increasing complexity of scientific models, large-scale simulation tools often require a critical amount of computational power to produce results in a reasonable amou...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...