Open Source Algorithms - Page 4
Sort By:
Algorithms
View 5792 business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
SIEM | API Security | Log Management SoftwareBuilt on the Graylog Platform, Graylog Security is the industry’s best-of-breed threat detection, investigation, and response (TDIR) solution. It simplifies analysts’ day-to-day cybersecurity activities with an unmatched workflow and user experience while simultaneously providing short- and long-term budget flexibility in the form of low total cost of ownership (TCO) that CISOs covet. With Graylog Security, security analysts can:
-
1
NTU RGB-D
Info and sample codes for "NTU RGB+D Action Recognition Dataset"
The “NTU RGB+D” repository provides access to a large-scale dataset for human action recognition (and its extension, NTU RGB+D 120). The dataset includes multiple modalities (RGB video, depth sequences, infrared video, 3D skeletal joint data) captured with multiple Kinect v2 cameras simultaneously. The repository also contains MATLAB / Python demo scripts for loading, visualizing, and processing skeleton data, mapping between modalities, and handling dataset structure. Multi-modal action recognition dataset, RGB, depth, infrared, skeletal data. Split into background / evaluation sets for one-shot evaluation (in the extended dataset). -
2
RBush
High-performance JavaScript R-tree-based 2D spatial index
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. -
3
TextDistance
Compute distance between sequences
Python library for comparing the distance between two or more sequences by many algorithms. For main algorithms, text distance try to call known external libraries (fastest first) if available (installed in your system) and possible (this implementation can compare this type of sequences). Install text distance with extras for this feature. Textdistance use benchmark results for algorithm optimization and try to call the fastest external lib first (if possible). TextDistance show benchmarks results table for your system and saves libraries priorities into the libraries.json file in TextDistance's folder. This file will be used by text distance for calling the fastest algorithm implementation. Default libraries.json is already included in the package. -
4
The Algorithms Python
All Algorithms implemented in Python
The Algorithms-Python project is a comprehensive collection of Python implementations for a wide range of algorithms and data structures. It serves primarily as an educational resource for learners and developers who want to understand how algorithms work under the hood. Each implementation is designed with clarity in mind, favoring readability and comprehension over performance optimization. The project covers various domains including mathematics, cryptography, machine learning, sorting, graph theory, and more. With contributions from a large global community, it continually grows and improves through collaboration and peer review. This repository is an ideal reference for students, educators, and developers seeking hands-on experience with algorithmic concepts in Python. -
Dominate AI Search ResultsAthenaHQ is a cutting-edge platform for Generative Engine Optimization (GEO), designed to help brands optimize their visibility and performance across AI-driven search platforms like ChatGPT, Google AI, and more.
-
5
javascript-algorithms
JavaScript implementations of computer science algorithms
javascript-algorithms is a repository that implements a comprehensive collection of classic data structures and algorithmic solutions in JavaScript — including sorting, searching, graph algorithms, dynamic programming, and more. It serves as a learning and reference resource for developers wanting to understand how standard algorithms can be expressed in JavaScript, bridging the gap between theoretical algorithm knowledge and practical implementation usable in web or Node.js contexts. Because algorithms are implemented in a language (JavaScript) many developers use daily, the repo becomes especially useful for students, interview-preparation candidates, or anyone wanting to learn algorithmic thinking without switching languages. The code tends to be readable, structured, and adapted to JavaScript idioms, making it easier to follow for JS developers. -
6
tracking.js
A modern approach for Computer Vision on the web
The tracking.js library brings different computer vision algorithms and techniques into the browser environment. By using modern HTML5 specifications, we enable you to do real-time color tracking, face detection and much more, all that with a lightweight core (~7 KB) and intuitive interface. To get started, download the project. This project includes all of the tracking.js examples, source code dependencies you'll need to get started. Unzip the project somewhere on your local drive. The package includes an initial version of the project you'll be working with. While you're working, you'll need a basic HTTP server to serve your pages. Test out the web server by loading the finished version of the project. The main goal of tracking.js is to provide those complex techniques in a simple and intuitive way on the web. We believe computer vision is important to improve people's life, bringing it to the web will make this future a reality a lot faster. -
7
Java·Applied·Geodesy·3D
Least-Squares Adjustment Software for Geodetic Sciences
JAG3D is no longer developed at source-forge, and has moved to GitHub. Please visit https://github.com/applied-geodesy/jag3d or https://software.applied-geodesy.org to get the latest version. -
8
NOTE: The GROOVE codebase has moved to https://github.com/nl-utwente-groove
">
-
9
A bignum library written in the C++ programming language as templates. It provides standard mathematical operations like add, sub, mul, div, pow etc. with the big integer and big floating point numbers.
-
Teradata VantageCloud Enterprise is a data analytics platform for performing advanced analytics on AWS, Azure, and Google Cloud.VantageCloud is the complete cloud analytics and data platform, delivering harmonized data and Trusted AI for all. Built for performance, flexibility, and openness, VantageCloud enables organizations to unify diverse data sources, run complex analytics, and deploy AI models—all within a single, scalable platform.
-
10
AlgoSim
AlgoSim : création, analyse et exécution des algorithmes
AlgoSim un Logiciel de création, analyse, simulation et exécution des algorithmes. Il ne nécessite aucun apprentissage de langage de programmation. Ce logiciel n'utilise pas un éditeur de texte comme les logiciels classiques de programmation. Ce logiciel peut être utilisé par des débutants pour apprendre la programmation et exercer leurs connaissances. Il peut être utilisé par des professionnel pour tester leurs algorithmes, les vérifier et générer des programme présentables (pseudo-code ou programme Pascal) . -
11
-
12
C++ Library of Abstract Algebra concepts and arithmetic algorithms defined in terms of these concepts, using Instigate Generic Programming Methodology. Based on this library we plan to develop Linear Algebra and Optimization concepts and algorithms.
-
13
This library contains generic algorithms from STL and boost.org and other sources, re-implemented using Instigate's GP methodology, based on modern principles of Generic Programming.
-
14
libPGF
libPGF is an implementation of the Progressive Graphics File (PGF)
The Progressive Graphics File (PGF) is an efficient image file format, that is based on a fast, discrete wavelet transform with progressive coding features. PGF can be used for lossless and lossy compression. It's most suitable for natural images. PGF can be used as a very efficient and fast replacement of JPEG 2000. -
15
JoSQL (Java Objects SQL) provides SQL capabilities for querying, ordering and grouping of collections of Java objects (POJOs). It allows a SQL statement to be applied to the collection of objects and the matching set returned, ordered and grouped.
-
16
PLP_Solvers
Library of solvers for work in Science, Engineering & Education
Portable library of solvers for work in Science, Engineering & Education. Library Contents: High Precision Computation, Numerical Calculus, Complex Analysis, Geometry, Linear Algebra, Special Functions, Differential Equations, Transformations, Optimization & Interpolation, Statistics, Physics ... (12,538 functions in v23.06 package) Knowledge of any programming language is not required. Only Windows port is available. -
17
jMetal is an object-oriented Java-based framework for solving multi-objective optimization problems with metaheuristics.
-
18
Crc32 is a Visual Basic 6 project using the crc32 algorithm. It consists of: * a console user interface (a native console application) * a graphical user interface (a html-xml-javascript generated interface using the webbrowser control)
-
19
McuOnEclipse
Releases of McuOnEclipse projects
Processor Expert components and Eclipse examples and plugins. -
20
devFlowCharter is a complete environment for creating program flowchart, source code generation, and compilation. Its main goal is to be straightforward, educational tool for use during procedural programming classes.
-
21
cds
Concurrent Data Structure library
CDS (Concurrent Data Structures) is a C++ template library of lock-free and fine-grained lock-based algorithms. It contains a collection of concurrent data structures: queues, stacks, sets, maps, etc, and safe memory reclamation schema for concurrent containers - Hazard Pointer and user-space RCU. See doxygen doc http://libcds.sourceforge.net/doc/cds-api/index.html. The source code repo for libcds 2.x has been moved to https://github.com/khizmax/libcds -
22
DJVU++
The DjVu complete solution,with OCR Technology(Arabic ,English).
DjVu++ is a user-friendly program that used to manipulate DjVu file formats such as eBooks with a penalty of editing features. The program introduce a free replacement for the property PDF format with similar resolution and smaller file size DjVu++ also support OCR to handle text in scanned books and images. The program shows good performance for English. In addition to the Arabic language to lead free and commercial software in this area. The main features of DjVu++ program are: o Manipulate DjVu files. o Support smaller size than PDF with the same performance. o DjVu++ supports two languages in the OCR technique (Arabic and English). o Read multiple documents at the same time with the new tabs feature. o DjVu++ supports multiple formats: Convert PDF document into DjVu format with smaller file size and the same performance. Convert DjVu into PDF format. Combine images to a single DjVu document. Perform OCR operations on multiple image formats. -
23
The Modular toolkit for Data Processing (MDP) is a Python data processing framework. From the user's perspective, MDP is a collection of supervised and unsupervised learning algorithms and other data processing units that can be combined into data processing sequences and more complex feed-forward network architectures. From the scientific developer's perspective, MDP is a modular framework, which can easily be expanded. The implementation of new algorithms is easy and intuitive. The new implemented units are then automatically integrated with the rest of the library. The base of available algorithms is steadily increasing and includes signal processing methods (Principal Component Analysis, Independent Component Analysis, Slow Feature Analysis), manifold learning methods ([Hessian] Locally Linear Embedding), several classifiers, probabilistic methods (Factor Analysis, RBM), data pre-processing methods, and many others.
-
24
La suite logicielle Monia est destinée à l'apprentissage de l'algorithmique en français. Elle permet de fabriquer un exécutable à partir d'un organigramme, en passant par un programme procédural écrit en pseudo-langage.
-
25
MultiBoost is a C++ implementation of the multi-class AdaBoost algorithm. AdaBoost is a powerful meta-learning algorithm commonly used in machine learning. The code is well documented and easy to extend, especially for adding new weak learners.