Open Source Algorithms - Page 43

This C++ demo allows users to interactively explore a quadtree's behavior. For this purpose the demo uses a quadtree data structure based on axis-aligned bounding boxes to speed up the search for triangles in a mesh. Depending on a search point all triangles of a quadtree's region are retrieved and relevant information about the search is shown. Quadtree creation can be parametrized by three parameters: - Maximum tree depth. - Maximum number of triangles per region. - Percentage of total number of triangles per region. The OpenGL graphics library is used to render the results, regions as well as the underlying triangle mesh. Navigation (e.g. zooming, moving) is available by keyboard and mouse. Example meshes are provided in wavefront *.obj format and can be opened from inside the program.

Quantitative Finance C++ Library.

Abandoned version of qbc. DOES NOT WORK properly

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.

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/

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.

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.

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.

The React Fiber Architecture project is a detailed technical document that explains the internal design and behavior of React Fiber, the core algorithm that powers modern React rendering. Rather than being a traditional code library, it serves as an educational deep dive into how React manages updates, scheduling, and reconciliation under the hood. The document explores how Fiber replaces the older stack-based reconciliation algorithm with a more flexible system that breaks rendering work into incremental units. This enables advanced features such as interruptible rendering, prioritization of updates, and smoother user interfaces during complex operations. It also introduces the concept of fibers as data structures representing units of work that can be paused, resumed, or reused. The project is especially valuable for developers who want to understand React’s performance model and concurrency features at a low level.

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

A Fast MAC based 3D Free surface fuid solver. Capable also of simulating viscoelastic fluids.Includes also wave equation solver for simulating shallow water phenomena.

Let P be a 2D point expressed in a plane area defined by four 2D points A,B,C,D. The aim of our C++ class is to express the coordinates of P in order to match when A,B,C,D is rectified as a rectangle. A demo application shows the use of the C++ class.

RIX common interface for parsing XML using recursive descent. It merges the 1-pass behavior of SAX with the ease of tree manipulation attributed to DOM. In short, RIX works by allowing client code to provide their production rules for any point in the parse tree. There are several advantages of RIX compared to DOM and SAX. DOM gives a full snapshot of the document being parsed, while RIX might be useful for when the document can be interpreted in one pass. Meanwhile, RIX lessens the overhead of writing a SAX-based parser, which might lend itself to a solution based on recursive descent anyway.

AleRBTree C# generic class for manipulating and navigating red black tree