Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.
Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.
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.
The Adobe Source Libraries (ASL) are a collection of C++ libraries building foundation technology to allow the construction of commercial applications by assembling generic algorithms through declarative descriptions.
This is a tidy lightweight library implementing a series of C++ Design Patterns, aiming to be simple, clean and portable. This library is made to help C++ programmers to develop projects with clearer and more compact source code.
A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.
Ertha is an open source GIS whose main focus is to guarantee easy extensibility and straightforward integration of custom modules. It provides basic geographic rendering and topologic analysis and exposes the main data structures loaded from shapefiles.
XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.
Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform.
Geographic restrictions, eligibility, and terms apply.
The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc
Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.
LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.
OptFlow is a C++ -based library for motion detection. It implements the classical Lucas-Kanade algorithm and a more advanced algorithm by Proesmans et.al. Several warping and morphing methods using the computed motion fields are also implemented.
a simple software implemented FPU. only 32bit precision is supported and the operation result is not accurate as modern FPUs, but it is light and compact. (uses simple 32bit integer operations only, good for machines that has no hardware FPU.)
NT2 is a multi-platform C++ library providing various template matrix classes that can be used with a Matlab(tm) like syntax whose performances are close to those obtained with hand written C code. NT2 comes with various numerical toolboxes.
ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.
Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.
Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.