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	112376
MD5	AAF28A350A10B8D5F57148BA74E65B28
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.6-5+b2
SHA-1	711D90531E38ECE86C7CA3325EFABD1665ACC5A3
SHA-256	8D4BE9E37D2BDC7C567FB6B75F5AFEA2F6CE3227BA2C038385E89234090D70C2

Key	Value
FileSize	94700
MD5	9FFB830BE1757DBEC9B41391372B7450
PackageDescription	fast algorithms for single, average/UPGMA and complete linkage clustering; profiling libraries 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, compiled for profiling. 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-prof
PackageSection	haskell
PackageVersion	0.4.6-5+b2
SHA-1	8308F769C1F5414D0A76C01198155E7F78115B45
SHA-256	AE9DE43D03C106A8F16196640B1058C87ACBECA0F9DB4587DF50CBB44C1D1B23