Eclat Algorithm Implementation

Eclat is a small, simple application specially designed to help you find frequent item sets (also closed and maximal) with the eclat algorithm, which carries out a depth first search on the subset lattice and determines the support of item sets by intersecting transaction lists. The current...

it is used for genetic algorithm implementation for scheduling in wireless sensor networks

Fast MD5 Implementation in Java is a heavily optimized implementation of the MD5 hashing algorithm written in Java. Fast MD5 Implementation in Java includes an optional native method for even greater speed improvements. How Fast Is It? Short answer:Much faster than any other Java...


Platforms: *nix

This is a simple implementation of the famous LZW algorithm.


Platforms: Matlab

Apriori is a small, simple, command prompt application designed to help you find association rules and frequent item sets (also closed and maximal) with the apriori algorithm, which carries out a breadth first search on the subset lattice and determines the support of item sets by subset tests....


Platforms: Windows

FPgrowth is a simple, tiny application that will help you find frequent item sets (also closed and maximal) with the fpgrowth algorithm (frequent pattern growth, Han et al 2000), which represents the transaction database as a prefix tree which is enhanced with pointers that organize the nodes...


Platforms: Windows

GFFT is generic simple and efficient Fast Fourier Transforms (FFT) implementation using policy-driven design and template metaprogramming. This new implementation of Fast Fourier transforms rose during study of the classical Cooley-Tukey algorithm and from an idea to assume the transform length...


Platforms: *nix

pycrc is a free, easy to use Cyclic Redundancy Check (CRC) calculator and source code generator pycrc provides CRC reference implementations in Python and a source code generator for C. The used CRC variant can be chosen from a fast but space-consuming implementation to slower but smaller...


Platforms: *nix

PTask, short for for Parallel Task, is a Java-based library that was designed in order to simplify the implementation of parallelized algorithms. The base concept is to define a description of your algorithms with it's parallel and serial sections and then execute these descriptions on a fixed...


Platforms: Windows

Lzip is a lossless data compressor based on the LZMA algorithm, with very safe integrity checking and a user interface similar to the one of gzip or bzip2. Lzip decompresses almost as fast as gzip and compresses better than bzip2, which makes it well suited for software distribution and data...


Platforms: Mac, Linux

The module implements the basic XTEA block encryption algorithm (`xtea_encrypt`/`xtea_decrypt`) and also provides a higher level `crypt` function which symmetrically encrypts/decrypts a variable length string using XTEA in OFB mode as a key generator. The `crypt` function does not use...


Platforms: Windows, Mac, *nix, Python, BSD Solaris

ClusterMX is developed as a CLI-based tool that is able to implement various clustering algorithms. Among those algorithms we can find: · K-Means clustering optimized by random walks; · Weighted K-Means (applying force filed to the multidimensional clustering space); · EM Clustering...


Platforms: Windows

MCN's Text Hasher is a small, simple application specially designed to offer you a MD5 based text hasher. This tool was developed to be as easy to use as possible: you just enter the text, press hash and you're good to go. for WindowsAll


Platforms: Windows

Algorithm::SkipList is a Perl implementation of skip lists. SYNOPSIS my $list = new Algorithm::SkipList(); $list->insert( key1, value ); $list->insert( key2, another value ); $value = $list->find(key2); $list->delete(key1); This is an implementation of skip lists in Perl. Skip...


Platforms: *nix

A flexible implementation of PSO algorithm with time-varying parameters. Algorithm is suitable for solving continuous optimization problems. Special care has been taken to enable flexibility of the algorthm with respect to its parameters and to initial population selection. Detailed logging of...


Platforms: Matlab

Algorithm::AhoCorasick::SearchMachine provides an implementation and low-level interface of Algorithm::AhoCorasick. Feeds input to the state machine. First (after the instance) argument of this method is the input text (which can be empty, in which case the method doesnt do anything), second...


Platforms: *nix

This is an extremely fast implementation of the famous Hungarian algorithm (aslo known as Munkres' algorithm). The new version (V2.2)is about 1.5 times faster than the old version (V2.1). It can solve a 1000 x 1000 problem in about 20 seconds in a Core Duo (T2500 @ 2.00GHz) XP laptop with Matlab...


Platforms: Matlab

In this M-file, the implementation of ACO Algorithm is given with the support of reference papers listed. You can easily use it as following command to see the pictures of result and the playing iterative course.ACO('filename.tsp');filename.tsp is the problem file of the Symmetrical or...


Platforms: Matlab

SpeedyGA is a vectorized implementation of a genetic algorithm in the Matlab programming language. Without bells and whistles, it faithfully implements the specification for a Simple GA given on pgs 10, 11 of M. Mitchell's GA book. See comments in code for details.This script has played a crucial...


Platforms: Matlab

General implementation of matlab version of Viterbi algorithm specifically written for gene structure finding problem in mind. However, it can be modified to suit the goal of a user.Input:Transition Probability MatrixEmission Probability MatrixInitial Probability MatrixStates Matrix (ie....


Platforms: Matlab