Search Results for "algorithm" - Page 3
Sort By:
Showing 523 open source projects for "algorithm"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
1
cppcrypto
C++ cryptographic library (modern hash functions, ciphers, KDFs)
...: Encrypt-then-MAC (EtM), GCM, OCB, ChaCha-Poly1305, Schwaemm. Streaming AEAD. MAC functions: HMAC, Poly1305. Key derivation functions: PBKDF2, scrypt, Argon2, HKDF. Includes sample command-line tools: - 'digest' - for calculating and verifying file checksum(s) using any of the supported hash algorithms (similar to md5sum or RHash). - 'cryptor' - for file encryption using Serpent-256 algorithm in AEAD mode. Check out the cppcrypto web site linked below for programming documentation. -
2
WaveFunctionCollapse
Bitmap & tilemap generation from a single example
... into the observation-propagation cycle. It may happen that during propagation all the coefficients for a certain pixel become zero. That means that the algorithm has run into a contradiction and can not continue. The problem of determining whether a certain bitmap allows other nontrivial bitmaps satisfying condition (C1) is NP-hard, so it's impossible to create a fast solution that always finishes. In practice, however, the algorithm runs into contradictions surprisingly rarely. -
3
GigaBASE is object-relational embedded database engine for C++ applications. It provides SQL-like query language, smart C++ interface (loading objects instead of tupples), transaction based on shadowing page algorithm (no separate log file and very fas
-
4
Dragonbox
Reference implementation of Dragonbox in C++
This library is a reference implementation of Dragonbox in C++. Dragonbox is a float-to-string conversion algorithm based on a beautiful algorithm Schubfach, developed by Raffaello Giulietti in 2017-2018. Dragonbox is further inspired by Grisu and Grisu-Exact. Dragonbox generates a pair of integers from a floating-point number: the decimal significand and the decimal exponent of the input floating-point number. These integers can then be used for string generation of the decimal representation... -
Powering the best of the internet | FastlyEnsure your websites, applications and services can effortlessly handle the demands of your users with Fastly. Fastly’s portfolio is designed to be highly performant, personalized and secure while seamlessly scaling to support your growth.
-
5
LASTAR
Automatic audio RMS normalizer & splitter
... RunTime to be installed https://www.microsoft.com/fr-fr/download/details.aspx?id=48145 You use LASTAR for your mobile music library ? Try now the new Android player with its real-time embedded algorithm ! https://play.google.com/store/apps/details?id=com.arthelion.loudplayer&hl=fr -
6
TSNE-CUDA
GPU Accelerated t-SNE for CUDA with Python bindings
This repo is an optimized CUDA version of FIt-SNE algorithm with associated python modules. We find that our implementation of t-SNE can be up to 1200x faster than Sklearn, or up to 50x faster than Multicore-TSNE when used with the right GPU. You can install binaries with anaconda for CUDA version 10.1 and 10.2 using conda install tsnecuda -c conda-forge. Tsnecuda supports CUDA versions 9.0 and later through source installation, check out the wiki for up to date installation instructions. Time... -
7
MACE
Deep learning inference framework optimized for mobile platforms
Mobile AI Compute Engine (or MACE for short) is a deep learning inference framework optimized for mobile heterogeneous computing on Android, iOS, Linux and Windows devices. Runtime is optimized with NEON, OpenCL and Hexagon, and Winograd algorithm is introduced to speed up convolution operations. The initialization is also optimized to be faster. Chip-dependent power options like big.LITTLE scheduling, Adreno GPU hints are included as advanced APIs. UI responsiveness guarantee is sometimes... -
8
Qbsolv
A decomposing solver
Qbsolv,a decomposing solver, finds a minimum value of a large quadratic unconstrained binary optimization (QUBO) problem by splitting it into pieces solved either via a D-Wave system or a classical tabu solver. (Note that qbsolv by default uses its internal classical solver. Access to a D-Wave system must be arranged separately.) -
9
opbdp
opbdp (non-linear) pseudo-Boolean optimization
opbdp is an implementation in C++ of an implicit enumeration algorithm for solving (non)linear 0-1 (or pseudo-Boolean) optimization problems with integer coefficients. A research report describing the techniques used in opbdp is included. -
No-Nonsense Code-to-Cloud Security for Devs | AikidoAikido provides a unified security platform for developers, combining 12 powerful scans like SAST, DAST, and CSPM. AI-driven AutoFix and AutoTriage streamline vulnerability management, while runtime protection blocks attacks.
-
10
GRAMPC
A gradient-based augmented Lagrangian framework for embedded NMPC
GRAMPC is a nonlinear MPC framework that is suitable for dynamical systems with sampling times in the (sub)millisecond range and that allows for an efficient implementation on embedded hardware. The algorithm is based on an augmented Lagrangian formulation with a tailored gradient method for the inner minimization problem. GRAMPC is implemented in plain C with an additional interface to C++ and MATLAB/Simulink. The basic structure and usage of GRAMPC are described in the documentation... -
11
WSClean
WSClean is a fast widefield interferometric imager
WSClean (w-stacking clean) is a fast generic widefield imager. It uses the w-stacking algorithm and can make use of the w-snapshot algorithm. As of Feb 2014, it is 2-12 times faster than CASA's w-projection, depending on the array configuration. It supports full-sky imaging and proper beam correction for homogeneous dipole arrays such as the MWA. WSClean allows Hogbom and Cotton-Schwab cleaning and has wideband, multiscale, compressed sensing and joined-polarization deconvolution modes. All... -
12
SpatGRIS2
Spatilization tool in in 2D and 3D
The SpatGRIS2 is an external multichannel sound spatializer for different configurations of speakers in 2D or 3D. SpatGRIS2 may include up to 128 inputs and outputs. DOME, CUBE, BINAURAL and STEREO modes are available. SpatGRIS2 provides the new CUBE algorithm that allows the use of any speaker configuration. Warning: SpatGRIS2 is not compatible with Catalina and up. SpatGRIS3 is now available. SpatGRIS2 and ControlGRIS have been developed by the Groupe de Recherche en Immersion Spatiale... -
13
Anime4KCPP
A high performance anime upscaler
Anime4KCPP provides an optimized bloc97's Anime4K algorithm version 0.9, and it also provides its own CNN algorithm ACNet, it provides a variety of way to use, including preprocessing and real-time playback, it aims to be a high-performance tool to process both image and video. This project is for learning and the exploration task of the algorithm course in SWJTU. Anime4K is a simple high-quality anime upscale algorithm. Version 0.9 does not use any machine learning approaches and can be very... -
14
Open source implementation of Elliptic Curve Primality Proving algorithm, using just the GMP library
-
15
Fastcoin (FST)
The fastest software-based online payment system
The fastest software-based online payment system RELEASE : v1.14.3.2 Fastcoin - Celebrating over eight years of fast & secure transactions. ------------------------------------------------------------------------ - Total coins will be 165,888,000. - 60 second block target (Modified in 2021) - Custom unique difficulty algorithm. - Retargets once every hour or 300 blocks. - Each block contains 32 coins which will be halved every year (or 2,592,000 blocks). - (Currently 2 coins per... -
16
Poly Indexes Generator
Know how each poly coefficient is constructed
The goal of this app is to confront the roots of a polynomial found after a root-finding algorithm has been executed assessing a polynomial. This app generates a list of parcels that can be used to assess the precision of roots that was found. -
17
PsoPath
Particle Swarm Optimization algorithm for the shortest path problem
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of Particle Swarm Optimization is the emulation of the social behaviour of, e.g., a flock of birds, as a stochastic optimisation method. Specifically, a particle is an entity representing a solution in the search space. Several particles cooperate... -
18
AcoPath
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. Development takes place at https://github.com/zfoxer/AcoPath -
19
LaPath
Learning Automata algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. Learning Automata (LA) are adaptive mechanisms requiring feedback from the executing environment to converge to certain states. In the context of network routing, LA residing at intermediate nodes along a path, exploit feedback from the destination node for... -
20
Base62 Encode/Decode Utility
A tool for encoding/decoding to base62
... program has been written to encode/decode files into this format. The syntax is similar to the popular base64 command line program. Inside the package there is a working c++ version of the base62 algorithm. the sources are inside the package. Note that from release 2.0.0 the algorithm is different from the one used before. If you have coded a file using base62 < 2.0.0 DO NOT USE base62 >= 2.0.0 to decode it. The 2.0.1 release has a new algorithm for chew, we have a compat flag -
21
JDS: Data Security
JDS is a powerful data protection program
JDS is a powerful tool for data protection. Documents are encrypted using a special algorithm. The data encryption algorithm is constantly updated to improve security. The program also provides other functions. Such as sending a file to a vault with password access, fast text encryption in 3 types, and much more. The program is easy to use and does not require special knowledge. The standard version has 2 languages (Russian and English) and 9 themes. You can download the language... -
22
Geophysical Library is a C++-library to handle geophysical data. At the moment the focus is on magnetotelluric and seismic data. It also includes a genetic algorithm for data inversion, signal processing and statistics routines.
-
23
SmillaEnlarger is a small graphical tool ( based on Qt ) to resize, especially magnify bitmaps in high quality. ( The used algorithm is an invention of my own )
-
24
Rainflow
Fast rainflow counting written in C (C99)
Rainflow Counting Algorithm (4-point-method), C99 compliant. "Rainflow Counting" consists of four main steps: 1. Hysteresis Filtering 2. Peak-Valley Filtering 3. Discretization 4. Four Point Counting Method: These steps are fully documented in standards such as ASTM E1049 "Standard Practices for Cycle Counting in Fatigue Analysis" [1]. This implementation uses the 4-point algorithm mentioned in [2]. To take the residue into account, you may implement a custom method... -
25
MaxBin2
An automatic tool for binning metagenomics sequences
MaxBin2 is the next-generation of MaxBin (https://sourceforge.net/projects/maxbin/) that supports multiple samples at the same time. MaxBin is a software for binning assembled metagenomic sequences based on an Expectation-Maximization algorithm. Users could understand the underlying bins (genomes) of the microbes in their metagenomes by simply providing assembled metagenomic sequences and the reads coverage information or sequencing reads. For users' convenience MaxBin will report genome...
