486 search results - page 46 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
CIAC
2000
Springer
14 years 2 days ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
DASFAA
2003
IEEE
14 years 1 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
PAA
2002
13 years 7 months ago
2002
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...