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	107480
MD5	9B34E127A0473712BF42066C2D30A6EF
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	888251AB4CF1A25F75BD4C7B6559BFFCC00A7BD7
SHA-256	9F612F6E84D4CC7DB6CC917193FE4A73C8756D61AAEB3BD94292F4D2034CF857

Key	Value
FileSize	105824
MD5	7FF7C630FC5B6505C8C2282BF2624718
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	5452CCE012B012CA807B521CD3F3DE1065D42074
SHA-256	03AB3EE0583CAB9E99A350E59548F6B4979A8826C76ED59512985AF5990EBE2F