Parents (Total: 2)

The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
FileSize	53864
MD5	EF56464B953650604EABF2FE9E5A2FA1
PackageDescription	fast algorithms for single, average/UPGMA and complete linkage clustering; documentation This package provides a function to create a dendrogram from a list of items and a distance function between them. Initially a singleton cluster is created for each item, and then new, bigger clusters are created by merging the two clusters with least distance between them. The distance between two clusters is calculated according to the linkage type. The dendrogram represents not only the clusters but also the order on which they were created. . This package has many implementations with different performance characteristics. There are SLINK and CLINK algorithm implementations that are optimal in both space and time. There are also naive implementations using a distance matrix. Using the dendrogram function from Data.Clustering.Hierarchical automatically chooses the best implementation we have. . This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libghc-hierarchical-clustering-doc
PackageSection	doc
PackageVersion	0.4.7-1build1
SHA-1	7134E384C1A67D2FDF4C69F7699B7E138AB9B89D
SHA-256	2B89E3ED24AED76620E7F7F40DC45078B3879D63D45362575E2F6E49FCCA510E

Key	Value
FileSize	64868
MD5	899E374D07D996EF0CDAE25D5DB0C93D
PackageDescription	fast algorithms for single, average/UPGMA and complete linkage clustering; documentation This package provides a function to create a dendrogram from a list of items and a distance function between them. Initially a singleton cluster is created for each item, and then new, bigger clusters are created by merging the two clusters with least distance between them. The distance between two clusters is calculated according to the linkage type. The dendrogram represents not only the clusters but also the order on which they were created. . This package has many implementations with different performance characteristics. There are SLINK and CLINK algorithm implementations that are optimal in both space and time. There are also naive implementations using a distance matrix. Using the dendrogram function from Data.Clustering.Hierarchical automatically chooses the best implementation we have. . This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainer	Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageName	libghc-hierarchical-clustering-doc
PackageSection	doc
PackageVersion	0.4.7-1
SHA-1	0366C0861ADB9BABF030CE13CB9D8D1EC0E27447
SHA-256	29EAA3DB62B81B528673A2AB8685C76ED2DFE26398C21DD00C74C13D2E829FE6