Mining Tiles: given a binary database, the code can find you all tiles (i.e. itemsets) that have an area (cardinality times support) larger than the given threshold. This can be done fairly efficiently, but may produce many many results.

Mining Tilings: given a binary database, the code can find you the (overlapping) k-set of itemsets that together cover as much of the 1's in the data as possible. This is fairly inefficient, in particular for dense datasets. (a non-overlapping tiling miner is in the works, but is not finished, and as I have not had time to further on it, it may remain so for a long time.)

The implementation is in C++ and was tested on Windows.