Sciweavers

198 search results - page 18 / 40
» Phylogenetic Networks, Trees, and Clusters
Sort
View
ICANN
2010
Springer
13 years 7 months ago
Visualising Clusters in Self-Organising Maps with Minimum Spanning Trees
Abstract. The Self-Organising Map (SOM) is a well-known neuralnetwork model that has successfully been used as a data analysis tool in many different domains. The SOM provides a to...
Rudolf Mayer, Andreas Rauber
TMC
2012
11 years 9 months ago
Resource-Aware Video Multicasting via Access Gateways in Wireless Mesh Networks
—This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative r...
Wanqing Tu, Cormac J. Sreenan, Chun Tung Chou, Arc...
CLUSTER
2005
IEEE
14 years 10 days ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
VECPAR
2004
Springer
14 years 2 days ago
Dynamically Adaptive Binomial Trees for Broadcasting in Heterogeneous Networks of Workstations
Binomial trees have been used extensively for broadcasting in clusters of workstations. In the case of heterogeneous nondedicated clusters and grid environments, the broadcasting o...
Silvia M. Figueira, Christine Mendes
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 1 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