Search Results for "algorithms" - Page 2
Sort By:
Showing 3570 open source projects for "algorithms"
View related 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.
-
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
1
BAT.jl
A Bayesian Analysis Toolkit in Julia
Welcome to BAT, a Bayesian analysis toolkit in Julia. BAT.jl offers a variety of posterior sampling, mode estimation and integration algorithms, supplemented by plotting recipes and I/O functionality. BAT.jl originated as a rewrite/redesign of BAT, the Bayesian Analysis Toolkit in C++. BAT.jl now offer a different set of functionality and a wider variety of algorithms than its C++ predecessor. -
2
Perceval
An open source framework for programming photonic quantum computers
...Through a simple object-oriented Python API, Perceval provides tools for composing circuits from linear optical components, defining single-photon sources, manipulating Fock states, running simulations, reproducing published experimental papers and experimenting with a new generation of quantum algorithms. It aims to be a companion tool for developing photonic circuits – for simulating and optimizing their design, modeling both the ideal and realistic behaviors, and proposing a normalized interface to control them through the concept of backends. -
3
Java JWT
Java implementation of JSON Web Token (JWT)
A Java implementation of JSON Web Token (JWT) - RFC 7519. This library requires Java 8 or higher. The last version that supported Java 7 was 3.11.0. The library implements JWT Verification and Signing using several algorithms. The Algorithm defines how a token is signed and verified. It can be instantiated with the raw value of the secret in the case of HMAC algorithms, or the key pairs or KeyProvider in the case of RSA and ECDSA algorithms. Once created, the instance is reusable for token signing and verification operations. When using RSA or ECDSA algorithms and you just need to sign JWTs you can avoid specifying a Public Key by passing a null value. ... -
4
SuiteSparse
The official SuiteSparse library: a suite of sparse matrix algorithms
The official SuiteSparse library: a suite of sparse matrix algorithms authored or co-authored by Tim Davis, Texas A&M University. -
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
5
OTPLib
One Time Password (OTP) / 2FA for Node.js and Browser
A JavaScript library for generating and verifying one-time passwords (TOTP/HOTP), commonly used for two-factor authentication (2FA). -
6
Flatbush
A very fast static spatial index for 2D points and rectangles in JS
...An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms. -
7
Zstandard
Zstandard - Fast real-time compression algorithm
...Zstd can trade compression speed for stronger compression ratios. It is configurable by small increment. Decompression speed is preserved and remain roughly the same at all settings, a property shared by most LZ compression algorithms, such as zlib or lzma. -
8
FrankWolfe.jl
Julia implementation for various Frank-Wolfe and Conditional Gradient
This package is a toolbox for Frank-Wolfe and conditional gradient algorithms. Frank-Wolfe algorithms were designed to solve optimization problems where f is a differentiable convex function and C is a convex and compact set. They are especially useful when we know how to optimize a linear function over C in an efficient way. -
9
LightGBM
Gradient boosting framework based on decision tree algorithms
LightGBM or Light Gradient Boosting Machine is a high-performance, open source gradient boosting framework based on decision tree algorithms. Compared to other boosting frameworks, LightGBM offers several advantages in terms of speed, efficiency and accuracy. Parallel experiments have shown that LightGBM can attain linear speed-up through multiple machines for training in specific settings, all while consuming less memory. LightGBM supports parallel and GPU learning, and can handle large-scale data. ... -
Full-stack observability with actually useful AI | Grafana CloudBuilt 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.
-
10
pybaselines
Library of algorithms for baseline correction of experimental data
...These include popular algorithms, such as AsLS, airPLS, ModPoly, and SNIP, as well as many lesser-known algorithms. Most algorithms are adapted directly from literature, although there are a few that are unique to pybaselines, such as penalized spline versions of Whittaker-smoothing-based algorithms. The full list of implemented algorithms can be found in the documentation. -
11
Alibi Explain
Algorithms for explaining machine learning models
Alibi is a Python library aimed at machine learning model inspection and interpretation. The focus of the library is to provide high-quality implementations of black-box, white-box, local and global explanation methods for classification and regression models. -
12
DataFrame
C++ DataFrame for statistical, Financial, and ML analysis
...You can also easily add your own algorithms. -
13
VectorChord
Scalable, fast, and disk-friendly vector search in Postgres
VectorChord is an open-source vector database built for local and edge deployment. It supports efficient vector indexing and retrieval using ANN (approximate nearest neighbor) algorithms and is optimized for integration with LLM and AI applications. VectorChord is lightweight and can be embedded in a variety of environments for fast semantic search. -
14
The NLopt module for Julia
Package to call the NLopt nonlinear-optimization library from Julia
This module provides a Julia-language interface to the free/open-source NLopt library for nonlinear optimization. NLopt provides a common interface for many different optimization algorithms. -
15
Coursera-ML-AndrewNg-Notes
Personal notes from Wu Enda's machine learning course
Coursera-ML-AndrewNg-Notes is an open-source repository that provides detailed study notes and explanations for Andrew Ng’s well-known machine learning course. The project aims to help students understand the mathematical concepts, algorithms, and intuition behind fundamental machine learning techniques taught in the course. It organizes the material into clear written summaries that accompany each lecture topic, including supervised learning, regression methods, neural networks, and optimization algorithms. The repository often expands on the original lecture material by adding additional explanations, diagrams, and formulas that clarify the theoretical foundations of the algorithms. -
16
SageMaker Python SDK
Training and deploying machine learning models on Amazon SageMaker
...With the SDK, you can train and deploy models using popular deep learning frameworks Apache MXNet and TensorFlow. You can also train and deploy models with Amazon algorithms, which are scalable implementations of core machine learning algorithms that are optimized for SageMaker and GPU training. If you have your own algorithms built into SageMaker-compatible Docker containers, you can train and host models using these as well. -
17
LineSearches.jl
Line search methods for optimization and root-finding
Line search methods for optimization and root-finding. This package provides an interface to line search algorithms implemented in Julia. The code was originally written as part of Optim, but has now been separated out to its own package. -
18
ReinforcementLearning.jl
A reinforcement learning package for Julia
A collection of tools for doing reinforcement learning research in Julia. Provide elaborately designed components and interfaces to help users implement new algorithms. Make it easy for new users to run benchmark experiments, compare different algorithms, and evaluate and diagnose agents. Facilitate reproducibility from traditional tabular methods to modern deep reinforcement learning algorithms. Make it easy for new users to run benchmark experiments, compare different algorithms, and evaluate and diagnose agents. ... -
19
gensim
Topic Modelling for Humans
Gensim is a Python library for topic modeling, document indexing, and similarity retrieval with large corpora. The target audience is the natural language processing (NLP) and information retrieval (IR) community. -
20
LZ4
Extremely fast compression algorithm
LZ4 is lossless compression algorithm, providing compression speed > 500 MB/s per core (>0.15 Bytes/cycle). It features an extremely fast decoder, with speed in multiple GB/s per core (~1 Byte/cycle). A high compression derivative, called LZ4_HC, is available, trading customizable CPU time for compression ratio. LZ4 library is provided as open-source software using a BSD license. This benchmark simulates simple "static content transfer" scenario such as OS Kernel compression or video game's... -
21
Stable Baselines3
PyTorch version of Stable Baselines
Stable Baselines3 (SB3) is a set of reliable implementations of reinforcement learning algorithms in PyTorch. It is the next major version of Stable Baselines. You can read a detailed presentation of Stable Baselines3 in the v1.0 blog post or our JMLR paper. These algorithms will make it easier for the research community and industry to replicate, refine, and identify new ideas, and will create good baselines to build projects on top of. -
22
ForwardDiff.jl
Forward Mode Automatic Differentiation for Julia
ForwardDiff implements methods to take derivatives, gradients, Jacobians, Hessians, and higher-order derivatives of native Julia functions (or any callable object, really) using forward mode automatic differentiation (AD). While performance can vary depending on the functions you evaluate, the algorithms implemented by ForwardDiff generally outperform non-AD algorithms (such as finite-differencing) in both speed and accuracy. Functions like f which map a vector to a scalar are the best case for reverse-mode automatic differentiation, but ForwardDiff may still be a good choice if x is not too large, as it is much simpler. The best case for forward-mode differentiation is a function that maps a scalar to a vector. -
23
bild
Image processing algorithms in pure Go
A collection of parallel image processing algorithms in pure Go. The aim of this project is simplicity in use and development over absolute high performance, but most algorithms are designed to be efficient and make use of parallelism when available. It uses packages from the standard library whenever possible to reduce dependency use and development abstractions. All operations return image types from the standard library. -
24
Gen.jl
A general-purpose probabilistic programming system
An open-source stack for generative modeling and probabilistic inference. Gen’s inference library gives users building blocks for writing efficient probabilistic inference algorithms that are tailored to their models, while automating the tricky math and the low-level implementation details. Gen helps users write hybrid algorithms that combine neural networks, variational inference, sequential Monte Carlo samplers, and Markov chain Monte Carlo. Gen features an easy-to-use modeling language for writing down generative models, inference models, variational families, and proposal distributions using ordinary code. ... -
25
OpenSpiel
Environments and algorithms for research in general reinforcement
...OpenSpiel also includes tools to analyze learning dynamics and other common evaluation metrics. Games are represented as procedural extensive-form games, with some natural extensions. The core API and games are implemented in C++ and exposed to Python. Algorithms and tools are written both in C++ and Python. To try OpenSpiel in Google Colaboratory, please refer to open_spiel/colabs subdirectory.
