SnOB is a C++ library implementing fast Fourier transforms on the symmetric group (group of permutations). Such Fourier transforms are used by some ranking and identity management algorithms, as well as certain graph invariants (graph kernels).
Prior to SnOb there was no widely available FFT package for permutations, which posed a high barrier to entry into the field, since non-commutative FFTs exploit technical results from representation theory. SnOB implements a number of variants on the regular Fourier transform, which are crucial to applications, and are not described elsewhere in the literature.
SnOB has a user friendly API, is fully object oriented, and puts a high premium on computational and storage efficiency. The package is fully documented, including an introduction to the mathematical background, a reference guide, and tutorial examples.
- Changes to previous version:
Initial Announcement on mloss.org.
- BibTeX Entry: Download
- Corresponding Paper BibTeX Entry: Download
- URL: Project Homepage
- Supported Operating Systems: Agnostic
- Data Formats: None
- Tags: Ranking, Nips2008, Fff, Fourier Transform, Group Theory, Harmonic Analysis, Identity Management, Permutations, Symmetric Group
- Archive: download here
No one has posted any comments yet. Perhaps you'd like to be the first?
Leave a comment
You must be logged in to post comments.