Search Results for "data"
Sort By:
Showing 265 open source projects for "data"
View related business solutions-
Easily Host LLMs and Web Apps on Cloud RunRun frontend and backend services, batch jobs, host LLMs, and queue processing workloads without the need to manage infrastructure. Cloud Run gives you on-demand GPU access for hosting LLMs and running real-time AI—with 5-second cold starts and automatic scale-to-zero so you only pay for actual usage. New customers get $300 in free credit to start.
-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
1
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. -
2
Zstandard
Zstandard - Fast real-time compression algorithm
Zstandard is a fast compression algorithm, providing high compression ratios. It also offers a special mode for small data, called dictionary compression. The reference library offers a very wide range of speed / compression trade-off, and is backed by an extremely fast decoder (see benchmarks below). Zstandard library is provided as open source software using a BSD license. Its format is stable and published as IETF RFC 8478. The negative compression levels, specified with --fast=#, offer faster compression and decompression speed in exchange for some loss in compression ratio compared to level 1, as seen in the table above. ... -
3
C# Algorithms
Plug-and-play class-library project of standard data structures
...Algorithms, a class library project which contains the Algorithms implementations. Data Structures, a class library project which contains the Data Structures implementations. Also, UnitTest, a unit-testing project for the Algorithms and Data Structures. -
4
LZ4
Extremely fast compression algorithm
...This benchmark simulates simple "static content transfer" scenario such as OS Kernel compression or video game's static assets (text/images/tables/scripts/etc) which loading from Flash Memory / HDD / SSD. In this case, compression time is completely ignored. Because only content developers compress the data at once and usually they don't care about its computational cost. But they always care end user's experience a.k.a. "loading time" and bandwidth. Please pay attention to "LZ4HC -9" which is quite faster than other methods. -
Run Any Workload on Compute Engine VMsCompute Engine delivers high-performance virtual machines for web apps, databases, containers, and AI workloads. Choose from general-purpose, compute-optimized, or GPU/TPU-accelerated machine types—or build custom VMs to match your exact specs. With live migration and automatic failover, your workloads stay online. New customers get $300 in free credits.
-
5
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. -
6
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. -
7
FATE
An industrial grade federated learning framework
...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. -
8
tsfresh
Automatic extraction of relevant features from time series
...With tsfresh this process is automated and all your features can be calculated automatically. Further tsfresh is compatible with pythons pandas and scikit-learn APIs, two important packages for Data Science endeavours in python. The extracted features can be used to describe or cluster time series based on the extracted characteristics. Further, they can be used to build models that perform classification/regression tasks on the time series. Often the features give new insights into time series and their dynamics. -
9
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, graph theory, and more. ... -
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
RBush
High-performance JavaScript R-tree-based 2D spatial index
RBush is a high-performance JavaScript library for 2D spatial indexing of points and rectangles. It's based on an optimized R-tree data structure with bulk insertion support. Spatial index is a special data structure for points and rectangles that allows you to perform queries like "all items within this bounding box" very efficiently (e.g. hundreds of times faster than looping over all items). It's most commonly used in maps and data visualizations. The demos contain visualization of trees generated from 50k bulk-loaded random points. ... -
11
NutsDB
A simple, fast, embeddable, persistent key/value store written in Go
A simple, fast, embeddable, persistent key/value store written in pure Go. It supports fully serializable transactions and many data structures such as list, set, sorted set. It supports fully serializable transactions and many data structures such as list、set、sorted set. All operations happen inside a Tx. Tx represents a transaction, which can be read-only or read-write. Read-only transactions can read values for a given bucket and a given key or iterate over a set of key-value pairs. ... -
12
KACTL
KTH algorithm competition template library
KACTL (the KTH Algorithmic Contest Template Library) is an extensively curated and high-performance C++ algorithms library created by the competitive programming team at the Royal Institute of Technology (KTH) to serve as a trusted, battle-tested codebase for algorithmic contests, programming competitions, and general algorithm development. The repository aggregates dozens of concise implementations of essential data structures, numerical methods, graph algorithms, string processing tools, computational geometry routines, and optimization techniques, all designed with speed, correctness, and compactness in mind. Instead of reinventing algorithms on the fly during contests like ACM-ICPC or Codeforces rounds, competitors can import exactly the component they need — whether a segment tree with lazy propagation, a minimum cost flow solver, or a fast Fourier transform — and focus their energy on problem logic and strategy. -
13
Yangshun Lago
Data Structures and Algorithms library in TypeScript and JavaScript
Lago is a study-oriented library of classic data structures and algorithms implemented in JavaScript with an emphasis on readability and learning. Instead of aiming to be a production runtime, it serves as a reference you can step through to understand how arrays, stacks, queues, linked lists, trees, heaps, graphs, and sorting/searching routines actually work. The implementations favor clarity over micro-optimizations, making them approachable for learners who are new to algorithmic thinking or coming from non-CS backgrounds. ... -
14
TBOX
A glib-like multi-platform c library
...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 for gzip, charset. etc. Implements stream transfer. Implements the static buffer stream for parsing data. Supports coroutine and implements asynchronous operation. The coroutine library. Provides high-performance coroutine switch. Supports arm, arm64, x86, x86_64. Provides channel interfaces. ... -
15
JCTools
Java Concurrency Tools for the JVM
Java Concurrency Tools for the JVM. This project aims to offer some concurrent data structures currently missing from the JDK. There’s more to come and contributions/suggestions are most welcome. JCTools has enjoyed support from the community and contributions in the form of issues/tests/documentation/code have helped it grow. JCTools offers excellent performance at a reasonable price (FREE! under the Apache 2.0 License). -
16
PRML
PRML algorithms implemented in Python
...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 algorithms, approximate inference, and sequential data methods — all following the book’s structure and notation. Many of these algorithms are paired with Jupyter notebooks that let users interact with the code, visualize results, and experiment with parameters in a way that deeply strengthens theoretical understanding. -
17
Flatbush
A very fast static spatial index for 2D points and rectangles in JS
...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. -
18
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 ultimately ranks posts to show what appears in a user’s feed. At its heart, the system uses a transformer-based model adapted from xAI’s Grok architecture to predict probabilities for various user actions (such as likes, replies, reposts, clicks, and negative signals), then combines those into a weighted final score that drives ranking. -
19
ngraph.path
Path finding in a graph
...It can be integrated with visualization libraries like VivaGraphJS to animate or highlight computed paths in a rendered graph, enabling interactive routing features. Its data structures and algorithm choices are optimized for performance and memory efficiency, so even large meshes or road networks can be navigated interactively. With its standalone design, ngraph.path can be used in browser apps, server-side Node.js services. -
20
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. Our intuitive interface is quick to grasp while hiding alot of power and complexity. ... -
21
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]. -
22
MOA - Massive Online Analysis
Big Data Stream Analytics Framework.
A framework for learning from a continuous supply of examples, a data stream. Includes classification, regression, clustering, outlier detection and recommender systems. Related to the WEKA project, also written in Java, while scaling to adaptive large scale machine learning. -
23
Armadillo
fast C++ library for linear algebra & scientific computing
* Fast C++ library for linear algebra (matrix maths) and scientific computing * Easy to use functions and syntax, deliberately similar to Matlab / Octave * Uses template meta-programming techniques to increase efficiency * Provides user-friendly wrappers for OpenBLAS, Intel MKL, LAPACK, ATLAS, ARPACK, SuperLU and FFTW libraries * Useful for machine learning, pattern recognition, signal processing, bioinformatics, statistics, finance, etc. * Downloads:... -
24
PANDA
A comprehensive and flexible quantification tool for proteomics data
...On the levels of spectra, peptides and proteins, PANDA works out a few quantitative filters and new scores for quantification confidence. Third, PANDA is designed for processing proteomics big data in parallel. -
25
To give users the full control over the running application. This means that an application is working according to its purpose but the control over the whole interface is taken from developer and given to users. While an application is running, users can move, resize, and tune all the screen objects through which the communication with an application is going. Set of files includes the book (both in DOC and PDF formats), a big demonstration project with all its files available (all the...
