Search Results for "algorithm"

... the source files are in C#), and an additional description of many used classes. Book uses the examples from the demo project to explain everything in details. The examples are from many different areas. Examples from the first part of the book are aimed at the details of algorithm and its use with different objects; examples from the second part are mostly the real and very useful applications.

Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal...

The C# RTree project aims to maintain a C# version of the RTree spatial indexing algorithm. Ported from https://sourceforge.net/projects/jsi

Trofast is an intelligent spell checker library based on statistical analysis developed for the Danish language. It makes use of n-grams, hidden Markov models and the Viterbi-algorithm.

CRFSharp(aka CRF#) is a .NET(C#) implementation of Conditional Random Fields, an machine learning algorithm for learning from labeled sequences of examples. It is widely used in Natural Language Process (NLP) tasks, for example: word breaker, postagging, named entity recognized, query chunking and so on. CRF#'s mainly algorithm is the same as CRF++ written by Taku Kudo. It encodes model parameters by L-BFGS. Moreover, it has many significant improvement than CRF++, such as totally parallel...

A proof-of-concept application of the Statistical Protocol IDentification (SPID) algorithm. SPID can detect the application layer protocol (layer 7) by analysing flow (packet sizes etc.) and payload statistics (byte values etc.) from pcap files.

Cloudster is a generic and parallel implementation of the k-means algorithm. It is written in C# and uses the Windows Azure environment.

This is a DataMining Tool developed by C# Just use Apirori Method to find the relation rules of data

A .NET implementation of the Gabow, Kaplan, Tarjan algorithm for testing the uniqueness of a perfect matching in a general graph.

NSvm is a .Net Support Vector Machine library written in .Net. NSvm features the SMO algorithm, a few kernels (including ad hoc algorithms for linear kernels). The objectives of NSvm are simplicity, flexibility and extensibility.

JAligner is an open source Java implementation of the dynamic programming algorithm Smith-Waterman with Gotoh's improvement for biological local pairwise sequence alignment with the affine gap penalty model.

A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)