Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch 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.
Start Free Trial
Our Free Plans just got better! | Auth0
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You 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.
A cross-platform library that computes fast and accurate SIFT image features. libsiftfast provides Octave/Matlab scripts, a command line interface, and a python interface (siftfastpy). Optimized with SIMD instructions and OpenMP .
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.
Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
Kuhn-Munkres is used inside assignment problem solver application. Instance generator application creates input file for the solver. Checker application verifies the solution computed by the solver. A bash script compiles, executes these apps.
This project implements insert and remove operations on AVL trees. Comments in the source explain the implementation. Test applications perform a run-time check of insert and remove methods. A bash script builds and executes the test applications.
AVL Array is a sequence container (like std::vector or std::list) that allows fast insert/remove AND fast random access. Shiftable Files offers the usual file primitives plus fast insert/remove. Get the latest version via BZR in the Develop section.
The MemSL for C and C++ includes a complete data structures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.
Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys
Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure
Native application identity and user-based security for your Azure cloud
Gain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.
CthughaNix is the reincarnation of Cthugha-L, a Linux port of one of the first audio visualization software packages, known as "An Oscilloscope On Acid".
A C++ RAII ( Resource Allocation Is Initialization ) implementation of an automatic pointer/reference. Pointable/Referenced objects are handled in a manner similar to Python. Strives to have the simplest syntax possible.
The IEEE 1619 Committee open-source reference implementations of encryption algorithms, plus testing and certification suites, for each encryption algorithm included in the standard.
Cycleopt optimizes the computational cost of multigrid algorithms. A cost and error model is used to optimally distribute the computational effort among the grids, depending on the desired accuracy of the solution and problem parameters.
The project will be looking at data (the intention is to begin looking at customer name/address data but this may widen over time) and ways to intelligently detect duplicates using fuzzy matching methods and algorithms.
A library with implementation of algorithms for solving Lot Sizing problems. The main focus of the library is on ease of use, while also attempting to keep it as efficient as possible.
The package implements a variety of tools for categorization of multivariate data such as boosted decision trees, bagging and random forest, bump hunting (PRIM), a multi-class learner and others.
OpenDark is a free simplification of 'dark'. It's the first open BWT-DC compressor, which has a simple code, high speed and compression ratio. And it's waiting for your ideas! :)
Complex list management with an extremely versatile interface. Built-in sorting (with abstract variants), finding, iteration, and element manipulation. Supports const-interface elements. Transparent 'virtual array storage' (VAS) for large element types
A LGPL library to handle xml documents in a DOM-like style. It's designed for LOW-performance systems (like embedded ones) and for lightly handle very large documents, automatically speeding up memory management in a user tunable style.
threadpool is a cross-platform C++ thread pool library. It provides a convenient way for dispatching asynchronous tasks and can be easily customized. threadpool is based on the high-quality Boost source libraries.