Search Results for "edmonds-karp algorithm implementation in python"
Sort By:
Showing 39 open source projects for "edmonds-karp algorithm implementation in python"
View related business solutions-
Simple, Secure Domain RegistrationRegister or renew your domain and pay only what we pay. No markups, hidden fees, or surprise add-ons. Choose from over 400 TLDs (.com, .ai, .dev). Every domain is integrated with Cloudflare's industry-leading DNS, CDN, and free SSL to make your site faster and more secure. Simple, secure, at-cost domain registration.
-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
1
Imagen - Pytorch
Implementation of Imagen, Google's Text-to-Image Neural Network
Implementation of Imagen, Google's Text-to-Image Neural Network that beats DALL-E2, in Pytorch. It is the new SOTA for text-to-image synthesis. Architecturally, it is actually much simpler than DALL-E2. It consists of a cascading DDPM conditioned on text embeddings from a large pre-trained T5 model (attention network). It also contains dynamic clipping for improved classifier-free guidance, noise level conditioning, and a memory-efficient unit design. It appears neither CLIP nor prior network... -
2
Bayesian Optimization
Python implementation of global optimization with gaussian processes
This is a constrained global optimization package built upon bayesian inference and gaussian process, that attempts to find the maximum value of an unknown function in as few iterations as possible. This technique is particularly suited for optimization of high cost functions, situations where the balance between exploration and exploitation is important. More detailed information, other advanced features, and tips on usage/implementation can be found in the examples folder. Follow the basic... -
3
openTSNE
Extensible, parallel implementations of t-SNE
openTSNE is a modular Python implementation of t-Distributed Stochasitc Neighbor Embedding (t-SNE) [1], a popular dimensionality-reduction algorithm for visualizing high-dimensional data sets. openTSNE incorporates the latest improvements to the t-SNE algorithm, including the ability to add new data points to existing embeddings [2], massive speed improvements [3] [4] [5], enabling t-SNE to scale to millions of data points, and various tricks to improve the global alignment of the resulting... -
4
MiniSom
MiniSom is a minimalistic implementation of the Self Organizing Maps
MiniSom is a minimalistic and Numpy-based implementation of the Self Organizing Maps (SOM). SOM is a type of Artificial Neural Network able to convert complex, nonlinear statistical relationships between high-dimensional data items into simple geometric relationships on a low-dimensional display. Minisom is designed to allow researchers to easily build on top of it and to give students the ability to quickly grasp its details. The project initially aimed for a minimalistic implementation... -
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.
-
5
LightZero
[NeurIPS 2023 Spotlight] LightZero
LightZero is an efficient, scalable, and open-source framework implementing MuZero, a powerful model-based reinforcement learning algorithm that learns to predict rewards and transitions without explicit environment models. Developed by OpenDILab, LightZero focuses on providing a highly optimized and user-friendly platform for both academic research and industrial applications of MuZero and similar algorithms. -
6
HDBSCAN
A high performance implementation of HDBSCAN clustering
..., is intuitive and easy to select. HDBSCAN is ideal for exploratory data analysis; it's a fast and robust algorithm that you can trust to return meaningful clusters (if there are any). -
7
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... -
8
MemU
MemU is an open-source memory framework for AI companions
... integration and a dedicated algorithm team for scenario-specific optimization. User behavior analysis, real-time monitoring, and automated agent optimization tools. 24/7 dedicated support team, custom SLAs, and professional implementation services. -
9
EPLB
Expert Parallelism Load Balancer
EPLB is DeepSeek’s open implementation of a load balancing algorithm designed for expert parallelism (EP) settings in MoE architectures. In EP, different “experts” are mapped to different GPUs or nodes, so load imbalance becomes a performance bottleneck if certain experts are invoked much more often. EPLB solves this by duplicating heavily used experts (redundancy) and then placing those duplicates across GPUs to even out computational load. It uses policies like hierarchical load balancing... -
Get the most trusted enterprise browserDefend against security incidents with Chrome Enterprise. Create customizable controls, manage extensions and set proactive alerts to keep your data and employees protected without slowing down productivity.
-
10
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... -
11
TextGen
textgen, Text Generation models
Implementation of Text Generation models. textgen implements a variety of text generation models, including UDA, GPT2, Seq2Seq, BART, T5, SongNet and other models, out of the box. UDA, non-core word replacement. EDA, simple data augmentation technique: similar words, synonym replacement, random word insertion, deletion, replacement. This project refers to Google's UDA (non-core word replacement) algorithm and EDA algorithm, based on TF-IDF to replace some unimportant words in sentences... -
12
LightFM
A Python implementation of LightFM, a hybrid recommendation algorithm
LightFM is a Python implementation of a number of popular recommendation algorithms for both implicit and explicit feedback, including efficient implementation of BPR and WARP ranking losses. It's easy to use, fast (via multithreaded model estimation), and produces high-quality results. It also makes it possible to incorporate both item and user metadata into the traditional matrix factorization algorithms. It represents each user and item as the sum of the latent representations... -
13
CleanRL
High-quality single file implementation of Deep Reinforcement Learning
CleanRL is a Deep Reinforcement Learning library that provides high-quality single-file implementation with research-friendly features. The implementation is clean and simple, yet we can scale it to run thousands of experiments using AWS Batch. CleanRL is not a modular library and therefore it is not meant to be imported. At the cost of duplicate code, we make all implementation details of a DRL algorithm variant easy to understand, so CleanRL comes with its own pros and cons. You should... -
14
MADDPG
Code for the MADDPG algorithm from a paper
MADDPG (Multi-Agent Deep Deterministic Policy Gradient) is the official code release from OpenAI’s paper Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments. The repository implements a multi-agent reinforcement learning algorithm that extends DDPG to scenarios where multiple agents interact in shared environments. Each agent has its own policy, but training uses centralized critics conditioned on the observations and actions of all agents, enabling learning in cooperative... -
15
Coach
Enables easy experimentation with state of the art algorithms
Coach is a python framework that models the interaction between an agent and an environment in a modular way. With Coach, it is possible to model an agent by combining various building blocks, and training the agent on multiple environments. The available environments allow testing the agent in different fields such as robotics, autonomous driving, games and more. It exposes a set of easy-to-use APIs for experimenting with new RL algorithms and allows simple integration of new environments... -
16
TextRank
TextRank implementation for Python 3
TextRank is an implementation of the TextRank algorithm for extractive text summarization and keyword extraction, inspired by Google’s PageRank. -
17
DetectAndTrack
The implementation of an algorithm presented in the CVPR18 paper
DetectAndTrack is the reference implementation for the CVPR 2018 paper “Detect-and-Track: Efficient Pose Estimation in Videos,” focusing on human keypoint detection and tracking across video frames. The system combines per-frame pose detection with a tracking mechanism to maintain identities over time, enabling efficient multi-person pose estimation in video. Code and instructions are organized to replicate paper results and to serve as a starting point for researchers working on pose in video... -
18
Evolution Strategies Starter
Code for the paper "Evolution Strategies.."
evolution-strategies-starter is an archived OpenAI research project that provides a distributed implementation of the algorithm described in the paper “Evolution Strategies as a Scalable Alternative to Reinforcement Learning” by Tim Salimans, Jonathan Ho, Xi Chen, and Ilya Sutskever. The repository demonstrates how to scale Evolution Strategies (ES) for reinforcement learning tasks using a master-worker architecture, where the master node broadcasts parameters to multiple workers... -
19
Universe Starter Agent
A starter agent that can solve a number of universe environments
The universe-starter-agent repository is an archived OpenAI codebase designed as a starter reinforcement-learning agent that can interact with and solve tasks in OpenAI’s Universe environment platform. Its purpose is to serve as a baseline or reference implementation so researchers or developers can see how to build agents that operate in real-time, visual environments (e.g., games, browser apps) via pixel observations and keyboard/mouse actions. Under the hood, this starter agent implements... -
20
The purpose of the current project is the development of a potentially open-source platform that would provide the capability to conduct virtual bioequivalence trial simulations. Ideally, this user-friendly platform will provide the user with many user-defined capabilities. Algorithm implementation for population pharmacokinetic analysis: The current project describes the marriage between PBPK modeling and population-based statistical analysis. The latter is necessary for parameter estimation...
-
21
D-Tailor
D-Tailor: automated analysis and design of DNA sequences
Recent advances in DNA cloning and synthesis technologies afford high throughput implementation of designed sequences into living cells. However, our ability to design sequences to interrogate multifactorial biological processes and further engineer biological functions is lagging behind. DNA-Tailor (D-Tailor) is a fully extendable software framework for biological sequence analysis and multi-objective sequence design. D-Tailor permits the seamless integration of an arbitrary number... -
22
node2vec
Learn continuous vector embeddings for nodes in a graph using biased R
The node2vec project provides an implementation of the node2vec algorithm, a scalable feature learning method for networks. The algorithm is designed to learn continuous vector representations of nodes in a graph by simulating biased random walks and applying skip-gram models from natural language processing. These embeddings capture community structure as well as structural equivalence, enabling machine learning on graphs for tasks such as classification, clustering, and link prediction... -
23
A toolkit in C++ and python to process both experimental and simulation data of colloidal particles. Includes among others * a multiscale particle tracking algorithm [1] whose C++ implementation is optimised for 3D confocal data. Python implementation is more versatile (2D and 3D data). * a Leica file reader, * Steindhard bond orientational order calculation * a VTK file writer 1. Leocmach, M. & Tanaka, H. A novel particle tracking method with individual particle size measurement...
-
24
Neural Libs
Neural network library for developers
This project includes the implementation of a neural network MLP, RBF, SOM and Hopfield networks in several popular programming languages. The project also includes examples of the use of neural networks as function approximation and time series prediction. Includes a special program makes it easy to test neural network based on training data and the optimization of the network. -
25
MusicPlayer
Music player - endlessly plays your music
... license * simple * support of most important sound formats. just uses FFmpeg * music database (optional) * audio volume normalization. own ReplayGain implementation * gapless playback * Last.fm scrobbling * AcoustID fingerprint * imports iTunes song ratings
