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	113404
MD5	C4550445BAA9E84CF0EC0E0488FF1CB7
PackageDescription	fast algorithms for single, average/UPGMA and complete linkage clustering 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 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-dev
PackageSection	haskell
PackageVersion	0.4.7-1+b1
SHA-1	65694881A169E21426C6ED017495EF7D3E5D7683
SHA-256	33BB53BF8BF82424A6D65A382881732DA87686692FC01AE8BC955B9F3E0D8DE1

Key	Value
FileSize	125360
MD5	ECA8975FF4124EBEEBD0484DD1EE547B
PackageDescription	fast algorithms for single, average/UPGMA and complete linkage clustering 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 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-dev
PackageSection	haskell
PackageVersion	0.4.7-1+b2
SHA-1	C2CF54737CB0A81AFEB2EF06A699A560555BC724
SHA-256	570CC705580DA2C523B0EE9FFA05181A4D9D035BA7794DF0F20753B428ADF12F