Search Results for "tiny core linux"
Sort By:
Showing 32 open source projects for "tiny core linux"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Ship Agents FasterGemini 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.
-
1
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++)... -
2
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... -
3
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.... -
4
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... -
Error to trace to log to deploy. One click. No SSH.AppSignal links every error to the trace, the trace to the log, the log to the deploy that shipped it.
-
5
Continuation Core and Toolboxes (COCO)
Toolboxes for parameter continuation and bifurcation analysis.
Development platform and toolboxes for parameter continuation, e.g., bifurcation analysis of dynamical systems and constrained design optimization. This material is based upon work partially supported by the National Science Foundation under Grant No. 1016467 and the Danish research council (FTP) under the project number 0602-00753B. Any opinions, findings, and conclusions or recommendations expressed on this site are those of the authors and do not necessarily reflect the views of the... -
6
PI-Based Image Encoder / Converter
Python code able to convert / compress image to PI (3.14, π) Indexes
...ZIP also include 16 MB file with 16,7 mil numbers of PI Benchmark(Single-Thread): Hardware & Environment Apple Silicon: Apple M2 (Mac mini/MacBook) x86_64 Platform: Intel Core Ultra 5 225F (Arrow Lake, 10 Cores) OS 1: Fedora 43 (GNOME) OS 2: Windows 11 Pro (23H2/24H2) Software: Python 3.14.3 + Numba JIT (latest) Results (Lower is better) Platform / OS CPU Time (Seconds) macOS (Native) Apple M2 52.151311 s (in default setup) Fedora Linux Intel Core Ultra 5 225F 58.536457 s (in default Power Management: Balanced) Windows 11 Intel Core Ultra 5 225F 59.681427 s (important! ... -
7
PetoronHash2
PH2 Permutation-based cryptographic post-quantum hash library with duplex construction (C++20)
PetoronHash2 (PH2) is a standalone ARX-based sponge construction that combines: A 4096-bit internal permutation core A sponge/duplex architecture with explicit capacity separation An extendable-output function (XOF) Memory-hard (HARD) and burn (BURN) modes A structured tagged absorb scheme A parameterized architecture suitable for hashing, KDF, and stress-oriented derivation PH2 is designed as a wide-state cryptographic primitive with explicit domain separation and configurable output... -
8
go-algorithms
Algorithms and data structures for golang
go-algorithms is an open-source educational repository that provides implementations of common algorithms and data structures written in the Go programming language. 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... -
9
JS-Sorting-Algorithm
A GitBook online book on sorting algorithms
JS-Sorting-Algorithm is an educational repository and GitBook-style resource about classic sorting algorithms. It explains sorting as a core topic in data structures and algorithms, with attention to internal sorting, external sorting, time complexity, memory usage, and stability. The guide covers ten major sorting methods, including bubble sort, selection sort, insertion sort, shell sort, merge sort, quicksort, heap sort, counting sort, bucket sort, and radix sort. It compares algorithms by... -
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.
-
10
Machine Learning Cheat Sheet
Classical equations and diagrams in machine learning
This repository is a visually rich and well-organized “cheat sheet” summarizing core machine learning concepts, algorithms, formulas, and best practices. It includes summaries of supervised and unsupervised learning methods, model evaluation metrics (accuracy, precision, recall, ROC/AUC), overfitting/underfitting, regularization (L1/L2), cross-validation, feature engineering techniques, and perhaps tips for hyperparameter tuning. Each section is presented concisely, often with diagrams,... -
11
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. Many challenges include hints and reference... -
12
AhoCorasickDoubleArrayTrie
An extremely fast implementation of Aho Corasick algorithm
AhoCorasickDoubleArrayTrie is a Java implementation of the Aho–Corasick multi-pattern matching algorithm that is optimized using a Double-Array Trie data structure. It is designed for fast keyword scanning across large texts, where you want to search for many patterns simultaneously and efficiently. The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. By using a double-array trie representation, the... -
13
PRMLT
Matlab code of machine learning algorithms in book PRML
This Matlab package implements machine learning algorithms described in the great textbook: Pattern Recognition and Machine Learning by C. Bishop (PRML). It is written purely in Matlab language. It is self-contained. There is no external dependency. This package requires Matlab R2016b or latter, since it utilizes a new Matlab syntax called Implicit expansion (a.k.a. broadcasting). It also requires Statistics Toolbox (for some simple random number generator) and Image Processing Toolbox (for... -
14
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. It keeps dependencies minimal so learners can focus on the math, implementation, and behavior of each robotics method.... -
15
FastFlow: programming multi-core
Pattern-based multi/many-core parallel programming framework
FastFlow is a C/C++ programming framework supporting the development of pattern-based parallel programs on multi/many-core, GPUs and distributed platforms. FastFlow run-time is built upon non-blocking threads and lock-free queues. Thanks to its very efficient CAS-free communication/synchronization support (e.g. few clock cycles core-to-core latency), FastFlow effectively supports the exploitation of fine grain parallelism, e.g. parallel codes managing very high frequency streams on commodity multi-core. ... -
16
STXXL is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, containers, and algorithms that can process huge volumes of data that only fit on disks.
-
17
TextTeaser
TextTeaser is an automatic summarization algorithm
textteaser is an automatic text summarization algorithm implemented in Python. It extracts the most important sentences from an article to generate concise summaries that retain the core meaning of the original text. The algorithm uses features such as sentence length, keyword frequency, and position within the document to determine which sentences are most relevant. By combining these features with a simple scoring mechanism, it produces summaries that are both readable and informative.... -
18
MyTinySTL
Achieve a tiny STL in C++11
This is a tinySTL based on C++11, which is my first project for practice. I use the Chinese documents and annotations for convenience, maybe there will be an English version later, but now I have no time to do that yet. Now I have released version 2.0.0. I have achieved the vast majority of the containers and functions of STL, and there may be some deficiencies and bugs. From version 2.x.x, the project will enter the stage of long-term maintenance, i.e., I probably will not add new content... -
19
React Fiber Architecture
A description of React's new core algorithm, React Fiber
The React Fiber Architecture project is a detailed technical document that explains the internal design and behavior of React Fiber, the core algorithm that powers modern React rendering. Rather than being a traditional code library, it serves as an educational deep dive into how React manages updates, scheduling, and reconciliation under the hood. The document explores how Fiber replaces the older stack-based reconciliation algorithm with a more flexible system that breaks rendering work... -
20
tracking.js
A modern approach for Computer Vision on the web
The tracking.js library brings different computer vision algorithms and techniques into the browser environment. By using modern HTML5 specifications, we enable you to do real-time color tracking, face detection and much more, all that with a lightweight core (~7 KB) and intuitive interface. To get started, download the project. This project includes all of the tracking.js examples, source code dependencies you'll need to get started. Unzip the project somewhere on your local drive. The... -
21
ViennaCL
Linear algebra and solver library using CUDA, OpenCL, and OpenMP
ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects. -
22
A light-weight Regular Expression (regex) C library, using double-recursion. (command prompt tester included)
-
23
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
24
AlgART Java Libraries
Open source library for processing arrays and matrices
AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over... -
25
tiny-DSP library
small and fast library dealing with signal processing
Tiny-DSP library contains c sources of a fast, tiny, portable and generic FFT (Fast Fourier transform) and inverse FFT. Supported are all power of two sizes (like 2,4,8,16,32,...) for one and two dimensional floating point arrays.
