Open Source Algorithms - Page 24

PAK is a collection of library code to handle the overhead of coding things like read-write locks, reflective multithreaded programming and simple file io. This is a java library collection, please see my API below...

Provisio.Collections brings STL like iterator-based containers to the .Net world (especially C#). It offers fundamental sequential (vector/list/deque) and associative (tree/skiplist) containers that can be filled, traversed and modified using iterators.

A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer Vision and Pattern Recognition, 2012. This source code is provided without warranty and is available under the GPL license. More commercially-friendly licenses may be available. Please contact Stephen O'Hara for license options. Please view the wiki on this site for installation instructions and examples on reproducing the results of the papers.

PyPlayground is an environment for developing algorithms involving movement in a space of up to three dimensions using Python.

PyVision is a object-oriented Computer Vision Toolkit for researchers that contains vision and machine learning algorithms and algorithm analysis and easily interfaces with scipy/numpy, PIL, opencv and other computer and machine learning libraries.

A Python module to learn all the major algorithms on the go! Purely for educational purposes. If you are using Python 2.7 use pip instead. Depending on your permissions, you might need to use pip install, user pygorithm to install. To see all the available functions in a module, you can just type help() with the module name as an argument.

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.

This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.

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.

Quantitative Finance C++ Library.

A Functor / "Function Object" library, providing classes implementing an operator(). A substantial improvement (IMHO) over what the standard provides, with composition, arithmetic expressions, "transform" operations, the naming convention and more.

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.

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.

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.

A portable C++ library of multi-threaded STL algorithms (transform, accumulate...) using standard containers and iostreams. Thread, mutex, spinlock are templatized. Close to Intel Threading Building Blocks, HPC++ or PSTL. Idea of A.Stepanov and M.Austen.

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.

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

Framework for building event-driven applications based on the reactor pattern.

A fully functional red-black tree implemented in C++/CLI with an OO approach of naming and structuring which makes the code highly readable as well as easily portable to C# or Java. The package also includes a binary search tree and two traversal algorithms.