Sciweavers

1541 search results - page 52 / 309
» From Comparing Clusterings to Combining Clusterings
Sort
View
ADAC
2010
124views more  ADAC 2010»
13 years 5 months ago
Methods for merging Gaussian mixture components
The problem of merging Gaussian mixture components is discussed in situations where a Gaussian mixture is fitted but the mixture components are not separated enough from each othe...
Christian Hennig
IPPS
1999
IEEE
14 years 1 months ago
All-to-All Broadcast on Switch-Based Clusters of Workstations
This paper presents efficient all-to-all broadcast algorithms for arbitrary irregular networks with switch-based wormhole interconnection and unicast message passing. First, all-t...
Matthew G. Jacunski, P. Sadayappan, Dhabaleswar K....
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
14 years 1 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
IDA
2003
Springer
14 years 2 months ago
An Iterated Local Search Approach for Minimum Sum-of-Squares Clustering
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
Peter Merz
HT
1991
ACM
14 years 18 days ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold