Search Results for "minimal linux"
Sort By:
10 projects for "minimal linux" with 2 filters applied:
-
$300 Free Credits to Build on Google CloudPut 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.
-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
1
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... -
2
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... -
3
CountBitsSet
minimal benchmark code for Counting Set Bits (ones) in an Integer
I was curious how much better the Algorithms, pointed out by BitTwiddling Hacks, perform than a simple Lookup Table approach... Now I think, perhaps my little investigation is interesting for others too... PS: the parallel counting Algo is about 35% faster on average on my computers than a simple LUT based solution. Also this shows nicely how different a human brain compatible solution is to a binary machine optimal solution :-) In the meantime I added other Algorithms beside... -
4
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... -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
5
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.... -
6
TARQUIN
MRS/NMR analysis software
Analysis software for MRS/NMR data. Allows processing and fitting to be performed in a fully automatic workflow. -
7
CRUSH
Data reduction and imaging for select astronomical cameras
CRUSH is a pioneering reduction and imaging suite for many astronomical cameras operating at far-infrared, submillimeter and millimeter wavelengths, such as SHARC-2, SCUBA-2, LABOCA, GISMO, or SOFIA/HAWC+ (to name a few). -
8
New Terrain and 3D Map System
a very lightweight advanced terrain-rendering and 3D map rendering sys
A very lightweight advanced terrain-rendering and 3D map rendering system. Minimal dependencies: OpenGL, SDL. It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not... -
9
The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. Šimeček, Daniel Langr, Pavel...
-
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.
-
10
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration,...
- Previous
- You're on page 1
- Next
