Select a tag to browse associated projects and drill deeper into the tag cloud.
Association mining has a number of algorithmic variants that are conveniently run on top of a lattice-theoretic structure. Slatt will provide such lattices with some convenience operations and implement some ways to facilitate mining optimum-size bases of association rules. Not intended yet for ... [More]
An implementation of the FKT algorithm for counting the number of perfect matchings in a graph. Written using the Gforth programming language.
Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.