Search Results for "java class diagram" - Page 4

An experimental unsupervised learning method for improvising jazz melodies, based on restricted Boltzmann machines (RBMs) layered into Deep Belief Networks (forms of neural networks).

This is an attempt to create simple image recognition program in java. Demo here: http://www.youtube.com/watch?v=N4m4j4D3pJU

The Darwin Genetic Programming Environment is a graphical Genetic Programming Environment for the facilitation of research in Genetic Programming.

E-learning Miner, formerly DŽEMUj is a tool for data mining from e-learning data. Aimed for teachers.

Blunder is an automated tool for analyzing chained exceptions in Java. It's usefull for classify, generate a customized error message and a list for possible solutions.

Highly reusable and extensible Decision-Tree (Max-Gain) framework comprising of comprehensive input-processing and display functionality. Handles nominal, linear, continuous data. For preliminary description, refer - http://sushain.com/blog/archives/

A general purpose Finite State Machine written in Java. It is easy to use, powerful, and fast.

TimeSleuth discovers temporal decision rules. It also judges the (a)causality of the rules. TimeSleuth can discover rules that involve time: {if (rainy_yesterday = true) then rainy_today = true}, or {if (rainy_tomorrow = true) then rainy_today = true}.

This project aimed at creating framework and binary data format for etymological Arabic system. and will not continue hosted at sourceforge because the term of use determine me as enemy, so I am prohibited from using sourceforge services.

Spec is a voice control based on the libraries of Sphinx-4.

UnBFuzzy is an API for fuzzy-logic and learning algorithms for fuzzy systems.

Supertagging is a process of statistical lexical disambiguation, preprocessing step to parsing, which assigns LTAG tree categories to the lexical items present in the input sentence. Thus, if the input sentence is in the form of a dependency tree, the task of the supertagger is to assign the most probable TAG family to each node and edge in the dependency tree.