Showing 73 open source projects for "collection"

View related business solutions
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • Veeam Data Platform v13.1 - Get Your Free Trial Icon
    Veeam Data Platform v13.1 - Get Your Free Trial

    Secure by design, portable by default. Recover clean, fast, anywhere. Start a free trial.

    Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
    Try it Free
  • 1
    ai-notebooks

    ai-notebooks

    Some ipython notebooks implementing AI algorithms

    ...Other notebooks examine reinforcement learning through PPO, SAC, TD3, VPG, and MuZero experiments. Transformer, recurrent-network, counterfactual-regret, and normalizing-flow examples broaden the collection. The notebooks are designed to be read directly on GitHub, making the repository useful for studying algorithms through working code.
    Downloads: 3 This Week
    Last Update:
    See Project
  • 2
    Pythonic Data Structures and Algorithms

    Pythonic Data Structures and Algorithms

    Minimal examples of data structures and algorithms in Python

    The Pythonic Data Structures and Algorithms repository by keon is a hands-on collection of implementations of classical data structures and algorithms written in Python. It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference. For students preparing for technical interviews, self-learners brushing up on fundamentals, or developers wanting to understand algorithm internals, this repository provides ready-to-run examples, and can serve as a sandbox to experiment, benchmark, or adapt code. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Exclusively Dark Image Dataset

    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...
    Downloads: 2 This Week
    Last Update:
    See Project
  • 4
    The Algorithms Python

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Get Started Free
  • 5
    bild

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    CryptoSwift

    CryptoSwift

    Collection of standard and secure cryptographic algorithms

    The master branch follows the latest currently released version of Swift. If you need an earlier version for an older version of Swift, you can specify its version in your Podfile or use the code on the branch for that version. Older branches are unsupported. Swift Package Manager uses debug configuration for debug Xcode build, that may result in significant (up to x10000) worse performance. Performance characteristic is different in Release build. XCFrameworks require Xcode 11 or later and...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    DomainBed

    DomainBed

    DomainBed is a suite to test domain generalization algorithms

    DomainBed is a PyTorch-based research suite created by Facebook Research for benchmarking and evaluating domain generalization algorithms. It provides a unified framework for comparing methods that aim to train models capable of performing well across unseen domains, as introduced in the paper In Search of Lost Domain Generalization. The library includes a wide range of well-known domain generalization algorithms, from classical baselines such as Empirical Risk Minimization (ERM) and...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    LinAsm

    LinAsm

    Collection of fast and optimized assembly libraries for x86-64 Linux

    LinAsm is collection of very fast and SIMD optimized assembly written libraries for x86-64 Linux. It implements many common and widely used algorithms for array manipulations: searching, sorting, arithmetic and vector operations, unit conversions; fast mathematical and statistic functions; numbers and time converting algorithms; finite impulse response (FIR) digital filters; spectrum analysis algorithms, Fast Hartley transformation; CPU cache friendly functions and extremely fast abstract data types (ADT) such as hash tables b-trees, and much more. ...
    Leader badge
    Downloads: 77 This Week
    Last Update:
    See Project
  • 9
    JUtilClasses

    JUtilClasses

    Java programmer's aid in useful methods and classes

    Util-Classes is a collection of Java classes for programming support in service for building applications. It covers a wide range of topics from simple small routines over Collection classes to larger utilities addressing IO-management, GUI topics and data safety.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Go from Code to Production URL in Seconds Icon
    Go from Code to Production URL in Seconds

    Cloud Run deploys apps in any language instantly. Scales to zero. Pay only when code runs.

    Skip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
    Try it free
  • 10

    Continuation Core and Toolboxes (COCO)

    Toolboxes for parameter continuation and bifurcation analysis.

    ...Documentation and tutorials are available for the following toolboxes: * ep : continuation and bifurcations of equilibrium points * coll : continuation of constrained collections of trajectory segments, including multi-segment boundary-value problems * po : continuation and bifurcations of periodic orbits in smooth and hybrid systems * recipes : collection of examples from the book Recipes for Continuation
    Leader badge
    Downloads: 19 This Week
    Last Update:
    See Project
  • 11
    Digraph3

    Digraph3

    A collection of python3 modules for Algorithmic Decision Theory

    This collection of Python3 modules provides a large range of implemented decision aiding algorithms useful in the field of outranking digraphs based Multiple Criteria Decision Aid (MCDA), especially best choice, linear ranking and absolute or relative rating algorithms with multiple incommensurable criteria. Technical documentation and tutorials are available under the following link: https://digraph3.readthedocs.io/en/latest/ The tutorials introduce the main objects like digraphs, outranking digraphs and performance tableaux. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    xstrings

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13
    VR Paged List for C# and more

    VR Paged List for C# and more

    VR Paged List for C# and more

    a collection of Vincent Radio {Adrix.NT} C# sources & build projects includes - Paged Lists & Iterators Library for C# - Multi Dimensional Array Library for C# - MDArray List Manager Library for C# - Adjacency (List | Matrix) Direct Graph Libs for C# - Range Check functions - VRMosaic (WinForms) - with Auto Resolver also includes - Source Files - Visual Studio Build Projects - Test Applics have fun adrixnt@hotmail.it
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14
    javascript-algorithms

    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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    GFPGAN

    GFPGAN

    GFPGAN aims at developing Practical Algorithms

    GFPGAN aims at developing Practical Algorithms for Real-world Face Restoration. Colab Demo for GFPGAN; (Another Colab Demo for the original paper model) Online demo: Huggingface (return only the cropped face) Online demo: Replicate.ai (may need to sign in, return the whole image). Online demo: Baseten.co (backed by GPU, returns the whole image). We provide a clean version of GFPGAN, which can run without CUDA extensions. So that it can run in Windows or on CPU mode. GFPGAN aims at developing...
    Downloads: 72 This Week
    Last Update:
    See Project
  • 16
    Gym

    Gym

    Toolkit for developing and comparing reinforcement learning algorithms

    ...It makes no assumptions about the structure of your agent, and is compatible with any numerical computation library, such as TensorFlow or Theano. The gym library is a collection of test problems — environments — that you can use to work out your reinforcement learning algorithms. These environments have a shared interface, allowing you to write general algorithms.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 17
    DifferenceKit

    DifferenceKit

    A fast and flexible O(n) difference algorithm framework

    A fast and flexible O(n) difference algorithm framework for Swift collection. The algorithm is optimized based on the Paul Heckel’s algorithm. This is a diffing algorithm developed for Carbon, works stand alone. The algorithm optimized based on the Paul Heckel’s algorithm. See also his paper A technique for isolating differences between files released in 1978. It allows all kind of diffs to be calculated in linear time O(n).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    Rank-BM25

    Rank-BM25

    A Collection of BM25 Algorithms in Python

    A collection of algorithms for querying a set of documents and returning the ones most relevant to the query. The most common use case for these algorithms is, as you might have guessed, to create search engines.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    go-algorithms

    go-algorithms

    Algorithms and data structures for golang

    ...The project is designed primarily as a learning resource to help developers understand how fundamental computer science concepts can be implemented idiomatically in Go. It includes a wide range of classic sorting, searching, and numerical algorithms alongside basic collection structures such as stacks, queues, linked lists, and binary trees. The repository is organized into clear directories by topic, making it easy for learners to explore specific categories of algorithms. Because the code focuses on clarity over heavy abstraction, it is especially useful for students and developers studying algorithmic fundamentals. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    Kalman and Bayesian Filters in Python

    Kalman and Bayesian Filters in Python

    Kalman Filter book using Jupyter Notebook

    Kalman Filter book using Jupyter Notebook. Focuses on building intuition and experience, not formal proofs. Includes Kalman filters,extended Kalman filters, unscented Kalman filters, particle filters, and more. All exercises include solutions. Introductory text for Kalman and Bayesian filters. All code is written in Python, and the book itself is written using Juptyer Notebook so that you can run and modify the code in your browser. What better way to learn? This book teaches you how to...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    interactive-coding-challenges

    interactive-coding-challenges

    120+ interactive Python coding interview challenges

    Interactive Coding Challenges is a collection of practice problems designed to strengthen data structures, algorithms, and problem-solving skills. The repository emphasizes a learn-by-doing approach: you read a prompt, attempt a solution, and verify behavior with tests, often within notebooks or scripts. Problems span arrays, strings, stacks, queues, linked lists, trees, graphs, dynamic programming, and more, mirroring common interview themes.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    frontend-interview

    frontend-interview

    The strongest front-end interview guide in the universe

    This is a review summary project about preparing for front-end interviews that I have summarized, and the project is updated from time to time. This is not only a strategy for job interviews, but also a collection of front-end ers to examine themselves and achieve breakthroughs. I hope that through this guide, everyone can open up their own lines of Ren and Du, and go further on the road to the front. This warehouse uses a large number of diagrams to convey knowledge. The so-called picture is worth a thousand words. I hope that this kind of graphic expression will make it easier for you to remember some abstract and incomprehensible concepts. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    PythonRobotics

    PythonRobotics

    Python sample codes and textbook for robotics algorithms

    PythonRobotics is a Python code collection and textbook for learning robotics algorithms through readable examples. It covers practical topics such as localization, mapping, path planning, path tracking, control, SLAM, and autonomous navigation. The project is written to make each algorithm’s core idea easy to understand, rather than hiding the logic behind large frameworks.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    Genetic Algorithm File Fitter, GAFFitter for short, is a tool based on a genetic algorithm (GA) that tries to fit a collection of items, such as files/directories, into as few as possible volumes of a specific size (e.g. CDs or DVDs).
    Downloads: 21 This Week
    Last Update:
    See Project
  • 25

    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
    Downloads: 2 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • 2
  • 3
  • Next