Muster
|
![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | Overloaded utility functions to convert between arbitrary C/C++ types and MPI types, custom typedefs for cstdlib types like size_t, and a wrapper for MPI_Pack_Size |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() | |
![]() ![]() ![]() | Template function implementations of the Bayesian Information Criterion |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | Dummy output iterator that counts how many times it was assigned to. without actually storing anything |
![]() ![]() ![]() | Data types and functions for dealing with dissimilarity matrices |
![]() ![]() ![]() | |
![]() ![]() ![]() | MPI-packable, templated struct for shipping around an MPI-packable object plus the id of the process it came from |
![]() ![]() ![]() | |
![]() ![]() ![]() | Implementations of the classic clustering algorithms PAM and CLARA, from Finding Groups in Data, by Kaufman and Rousseeuw |
![]() ![]() ![]() | #defines for switching between MPI and PMPI bindings |
![]() ![]() ![]() | Asynchronous, some-to-some gather operation used by parallel clustering algorithms to simultaneously send members of sample sets to a set of distributed worker processes |
![]() ![]() ![]() | |
![]() ![]() ![]() | |
![]() ![]() ![]() | CAPEK and XCAPEK scalable parallel clustering algorithms |
![]() ![]() ![]() | |
![]() ![]() ![]() | Distributed representation of a partitioning of a data set |
![]() ![]() ![]() | |
![]() ![]() ![]() | Class to represent a partitioning of a data set |
![]() ![]() ![]() | Helper functions for taking random samples and seeding RNGs from the system clock |
![]() ![]() ![]() | |
![]() ![]() ![]() | Data structure representing a trial run of a partitioned clustering algorithm |