22 search results - page 3 / 5 » Engineering an External Memory Minimum Spanning Tree Algorit... |
PDPTA
2003
13 years 7 months ago
2003
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
HPCC
2007
Springer
13 years 11 months ago
2007
Springer
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...
BMCBI
2005
13 years 5 months ago
2005
Background: Peptide Mass Fingerprinting (PMF) is a widely used mass spectrometry (MS) method of analysis of proteins and peptides. It relies on the comparison between experimental...
ADHOCNOW
2007
Springer
13 years 11 months ago
2007
Springer
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
FSTTCS
2007
Springer
13 years 11 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...