Search Results for "Open Source Discovery Open Source & DevTools"
Sort By:
Showing 836 open source projects for "Open Source Discovery Open Source & DevTools"
View related business solutions-
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
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.
-
1
PlatEMO
Evolutionary multi-objective optimization platform
Evolutionary multi-objective optimization platform. PlatEMO consists of a number of MATLAB functions without using any other libraries. Any machines able to run MATLAB can use PlatEMO regardless of the operating system. PlatEMO includes more than ninety existing popular MOEAs, including genetic algorithm, differential evolution, particle swarm optimization, memetic algorithm, estimation of distribution algorithm, and surrogate model-based algorithm. Most of them are representative algorithms... -
2
AlphaZero.jl
A generic, simple and fast implementation of Deepmind's AlphaZero
Beyond its much publicized success in attaining superhuman level at games such as Chess and Go, DeepMind's AlphaZero algorithm illustrates a more general methodology of combining learning and search to explore large combinatorial spaces effectively. We believe that this methodology can have exciting applications in many different research areas. Because AlphaZero is resource-hungry, successful open-source implementations (such as Leela Zero) are written in low-level languages (such as C++) and optimized for highly distributed computing environments. This makes them hardly accessible for students, researchers and hackers. Many simple Python implementations can be found on Github, but none of them is able to beat a reasonable baseline on games such as Othello or Connect Four. ... -
3
Exclusively Dark Image Dataset
ExDARK dataset is the largest collection of low-light images
The Exclusively Dark (ExDARK) dataset is one of the largest curated collections of real-world low-light images designed to support research in computer vision tasks under challenging lighting conditions. It contains 7,363 images captured across ten different low-light scenarios, ranging from extremely dark environments to twilight. Each image is annotated with both image-level labels and object-level bounding boxes for 12 object categories, making it suitable for detection and classification... -
4
Rubix ML
A high-level machine learning and deep learning library for PHP
Rubix ML is a free open-source machine learning (ML) library that allows you to build programs that learn from your data using the PHP language. We provide tools for the entire machine learning life cycle from ETL to training, cross-validation, and production with over 40 supervised and unsupervised learning algorithms. In addition, we provide tutorials and other educational content to help you get started using ML in your projects. -
Streamline Azure Security with Palo Alto Networks VM-SeriesImprove your security posture and reduce incident response time. Use the VM-Series to natively analyze Azure traffic and dynamically drive policy updates based on workload changes.
-
5
X For You Feed Algorithm
Algorithm powering the For You feed on X
X For You Feed Algorithm is the open-sourced core recommendation system that powers the For You feed on X (the social network formerly known as Twitter), and it represents one of the first times a major social platform has published production-level ranking code for public review and experimentation. The repository contains the full pipeline that ingests user engagement and content candidate data, processes it through retrieval, hydration, filtering, scoring, and selection layers, and... -
6
FATE
An industrial grade federated learning framework
...FATE became open-source in February 2019. FATE TSC was established to lead FATE open-source community, with members from major domestic cloud computing and financial service enterprises. FedAI is a community that helps businesses and organizations build AI models effectively and collaboratively, by using data in accordance with user privacy protection, data security, data confidentiality and government regulations. -
7
Hello Algorithm
Animated illustrations, one-click data structure
Animated illustrations, one-click data structure and algorithm tutorials. This project aims to create an open source, free, novice-friendly introductory tutorial on data structures and algorithms. The whole book uses animated illustrations, the content is clear and easy to understand, and the learning curve is smooth, guiding beginners to explore the knowledge map of data structures and algorithms. The source code can be run with one click, helping readers improve their programming skills during exercises and understand the working principles of algorithms and the underlying implementation of data structures. ... -
8
DualPipe
A bidirectional pipeline parallelism algorithm
DualPipe is a bidirectional pipeline parallelism algorithm open-sourced by DeepSeek, introduced in their DeepSeek-V3 technical framework. The main goal of DualPipe is to maximize overlap between computation and communication phases during distributed training, thus reducing idle GPU time (i.e. “pipeline bubbles”) and improving cluster efficiency. Traditional pipeline parallelism methods (e.g. 1F1B or staggered pipelining) leave gaps because forward and backward phases can’t fully overlap... -
9
Machine Learning Octave
MatLab/Octave examples of popular machine learning algorithms
This repository contains MATLAB / Octave implementations of popular machine learning algorithms, along with explanatory code and mathematical derivations, intended as educational material rather than production code. Implementations of supervised learning algorithms (linear regression, logistic regression, neural nets). The author’s goal is to help users understand how each algorithm works “from scratch,” avoiding black-box library calls. Code written so as to expose and comment on... -
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.
-
10
PRML
PRML algorithms implemented in Python
PRML repository is a respected and well-maintained project that implements the foundational algorithms from the famous textbook Pattern Recognition and Machine Learning by Christopher M. Bishop, providing a practical and accessible Python reference for both students and professionals. Rather than just summarizing concepts, the repository includes working code that demonstrates linear regression and classification, kernel methods, neural networks, graphical models, mixture models with EM... -
11
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,... -
12
TBOX
A glib-like multi-platform c library
TBOX is a glib-like cross-platform C library that is simple to use yet powerful in nature. The project focuses on making C development easier and provides many modules (.e.g stream, coroutine, regex, container, algorithm ...), so that any developer can quickly pick it up and enjoy the productivity boost when developing in C language. It supports the following platforms: Windows, Macosx, Linux, Android, iOS, BSD and etc. Supports file, data, http and socket source. Supports the stream filter... -
13
Flatbush
A very fast static spatial index for 2D points and rectangles in JS
A really fast static spatial index for 2D points and rectangles in JavaScript. 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. -
14
EASTL
EASTL, Electronic Arts Standard Template Library
EASTL stands for Electronic Arts Standard Template Library. It is a C++ template library of containers, algorithms, and iterators useful for runtime and tool development across multiple platforms. It is a fairly extensive and robust implementation of such a library and has an emphasis on high performance above all other considerations. If you are familiar with the C++ STL or have worked with other templated container/algorithm libraries, you probably don't need to read this. If you have no... -
15
Interpolations.jl
Fast, continuous interpolation of discrete datasets in Julia
This package implements a variety of interpolation schemes for the Julia language. It has the goals of ease of use, broad algorithmic support, and exceptional performance. Currently, this package supports B-splines and irregular grids. The API has been designed with the intent to support more options. Initial support for Lanczos interpolation was recently added. Pull requests are more than welcome! It should be noted that the API may continue to evolve over time. -
16
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... -
17
C# Algorithms
Plug-and-play class-library project of standard data structures
A plug-and-play class-library project of standard Data Structures and Algorithms, written in C#. It contains 75+ Data Structures and Algorithms, designed as Object-Oriented isolated components. Even though this project started for educational purposes, the implemented Data Structures and Algorithms are standard, efficient, stable and tested. This is a C#.NET solution-project, and it contains three subprojects. Algorithms, a class library project which contains the Algorithms implementations.... -
18
Swift Algorithm Club
Algorithms and data structures in Swift, with explanations
Swift Algorithm Club is a project that implements a broad collection of algorithms and data structures in the Swift programming language, with clear commentary and educational intent. Its purpose is not primarily to be a utility library, but rather to teach the how and why behind algorithms—readers can study implementations, complexity, and design choices in a Swift context. The repository includes common classic algorithms (sorting, searching, trees, graphs, dynamic programming, etc.) and... -
19
Python Outlier Detection
A Python toolbox for scalable outlier detection
PyOD is a comprehensive and scalable Python toolkit for detecting outlying objects in multivariate data. This exciting yet challenging field is commonly referred as outlier detection or anomaly detection. PyOD includes more than 30 detection algorithms, from classical LOF (SIGMOD 2000) to the latest COPOD (ICDM 2020) and SUOD (MLSys 2021). Since 2017, PyOD [AZNL19] has been successfully used in numerous academic researches and commercial products [AZHC+21, AZNHL19]. PyOD has multiple neural... -
20
trackers
Multi-object tracking algorithms
trackers is a plug-and-play multi-object tracking library designed to work with virtually any object detection model, enabling developers to follow objects across video frames with minimal setup. The library provides clean, modular implementations of leading tracking algorithms and can be used either from the command line or embedded directly into Python pipelines. It supports inputs such as videos, webcams, RTSP streams, or image directories and produces annotated tracking outputs that... -
21
xstrings
Implements string functions widely used in other languages
Go package xstrings is a collection of string functions, which are widely used in other languages but absent in Go package strings. All functions are well tested and carefully tuned for performance. Go functions have a unique naming style. One, who has experience in other languages but new in Go, may have difficulties finding out right string function to use. RightJustify returns a string with pad string at left side if str's rune length is smaller than length. If str's rune length is larger... -
22
leetcode-editor
Do Leetcode exercises in IDE
Do Leetcode exercises in IDE, support leetcode.com and leetcode-cn.com, to meet the basic needs of doing exercises.Support theoretically: IntelliJ IDEA PhpStorm WebStorm PyCharm RubyMine AppCode CLion GoLand DataGrip Rider MPS Android Studio. The login accounts of the two websites are not interoperable and the corresponding users need to be configured when switching websites. You can also refresh and load questions if you are not logged in, but you cannot submit it. Input the content and... -
23
ngraph.path
Path finding in a graph
ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to... -
24
Delaunator
Fast JavaScript library for Delaunay triangulation of 2D points
Delaunator is a fast library for Delaunay triangulation. It takes as input a set of points. The triangulation is represented as compact arrays of integers. It’s less convenient than other representations but is the reason the library is fast. After constructing a delaunay = Delaunator.from(points) object, it will have a triangles array and a halfedges array, both indexed by half-edge id. What’s a half-edge? A triangle edge may be shared with another triangle. Instead of thinking about each... -
25
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. Package convolution provides the functionality to create and apply a...
