Open Source Algorithms - Page 43

A Python library for easy creation and manipulation of Google Earth KML and KMZ placemark files. Please get your copy from http://pykml.cvs.sourceforge.net/viewvc/pykml/pykml/?view=tar

A neural net module written in python. The aim of the project is to provide a large set of neural network types accessed by an API that is easy to use and powerful.

A threaded Web graph (Power law random graph) generator written in Python. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It implements a threaded variant of the RMAT algorithm.

Bit operations on integers for Python - fast C implementation of bit extraction, counting, reversal etc.

This library is meant to offer an array of general purpose data structures and algorithms for a multitude of uses. Each structure must be examined for its specific usefulness to be determined. Please see the API documentation for more details.

A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library.

software educativo de aplicacion de metaheuristicas sobre problemas de grafos, TSP problema del agente viajero, ruta mas corta, arbol de expansion minima, etc.

This is a projct simulation code for my term report. It will be written in Python.

Quantitative Finance C++ Library.

Abandoned version of qbc. DOES NOT WORK properly

QuickMP (Quick Multi-Processing) is a simple cross-platform C++ API for generating parallel for loops in shared-memory programs, similar to OpenMP. It provides automatic scalable performance based on the number of available processors.

Small console application written in C to simplify boolean functions with the Quine-McCluskey algorithm

Turing Machine Simulator using Quintuples (5-tuples). Intended for primarily for Computer Science education.

quiplib is a c++ library that contains some classes to simplify you network programing and ACE programming. And implement some important and useful patterns in templates

Download Free Associated R open source script files for big data analysis with Hadoop and R These are R script source file from Ram Venkat from a past Meetup we did at http://www.meetup.com/R-Matlab-Users/events/85160532/ Also, there is a long video and Powerpoint presentation slide PDF with R files at: http://quantlabs.net/blog/2012/11/how-to-use-hadoop-and-r-for-big-data-parallel-processing-free-download-pdf/ Download source files from http://quantlabs.net/blog/2012/11/download-free-associated-r-open-source-script-files-for-big-data-analysis-with-hadoop-and-r-rstats-hadoop/

RBush is a high-performance JavaScript library for 2D spatial indexing of points and rectangles. It's based on an optimized R-tree data structure with bulk insertion support. Spatial index is a special data structure for points and rectangles that allows you to perform queries like "all items within this bounding box" very efficiently (e.g. hundreds of times faster than looping over all items). It's most commonly used in maps and data visualizations. The demos contain visualization of trees generated from 50k bulk-loaded random points. Open web console to see benchmarks; click on buttons to insert or remove items; click to perform search under the cursor. An optional argument to RBush defines the maximum number of entries in a tree node. 9 (used by default) is a reasonable choice for most applications. Higher value means faster insertion and slower search, and vice versa.

RL++ is an easy to use modular open source library for Reinforcement Learning written in C++. It includes learning algorithms (TD, Sarsa, Q) as well as the implementation of value function representations (LookupTable, TileCoding, Neuronal Network).

I have written the code of RPnP available at http://xuchi.weebly.com/uploads/5/6/7/3/5673896/rpnp1.0.zip in C++ with the help of OpenCV

Rejection-based stochastic simulation algorithm (RSSA) is an efficient exact algorithm for doing stochastic simulation of biochemical reaction systems. RSSA improves over state of the art of stochastic simulations by avoiding and collapsing as much the number of propensity updates.

Raiden block cipher: An extremely lightweight and fast block cipher, developed using genetic programming, with the intention to be an alternative to TEA. This cipher is as fast as TEA, and without many of its known weaknesses.

Random Projection Trees is a recursive space partitioning datastructure which can automatically adapt to the underlying (linear or non-linear) structure in data. It has strong theoretical guarantees on rates of convergence and works well in practice.

The Rank Aggregation and Evaluation Suite is a comprehensive set of rank aggregation algorithms and performance measurement tools for use in research.

A collection of algorithms for querying a set of documents and returning the ones most relevant to the query. The most common use case for these algorithms is, as you might have guessed, to create search engines.

The rating algorithms library contains various algorithms used to accurately rank, score or rate collections of similar data. One example is the ranking of votes based on a 5 star scale. This project started as a need of ordering data based on the relevance of each record obtained from users. The first algorithm implemented is based on Wilson Score Interval.

AnalyzerTask for calculating the rate popularity for ContentObjects integrated into the iQser GinServer. Developed by niPRO-Project.