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
MongoDB Atlas runs apps anywhere
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB 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.
ADTL is an Advanced Data structures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.
LAITOR is a text mining software developed to find co-occurrence of biological entities (gene/protein terms) together with biointeractions and concepts term from customized dictionaries.
A cross-platform library that computes fast and accurate SIFT image features. libsiftfast provides Octave/Matlab scripts, a commandline interface, and a python interface (siftfastpy). Optimized with SIMD instructions and OpenMP .
Utility to validate, extract, show and create digital documents included in files with "pk7" and "fp7" extensions such as electronic bills provided by some phone companies in Spain like Movistar and Telefonica.
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.
Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform.
Geographic restrictions, eligibility, and terms apply.
A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com).
Given a log-file, this tool will replay a T4C game you've played before.
It will have built-in functionnalities like : merging log files
together, searching and cleaning
This is an Ada implementation of the Dancing Links X Algorithm as in Donald E. Knuth paper. AdaDLX is used to solve the Eight-Queens puzzle, Sudoku grids and Blocs in Box puzzle.
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.
WORDFIELD is an extremely fast incremental word list generator. It's meant for use with a password recovery tool such as John the Ripper or aircrack-ng.
TCache is high performance key/value storage component. It can be easily plugged into any existing high-performance, distributed memory object caching systems such as MemcacheD or Dynamo, speeding up dynamic web applications by reducing database load
Raiden block cipher: An extremely lightweight and fast block cipher, developed using genetic programming, with the intention to be an alternative to TEA. This cipher is as fast as TEA, and without many of its known weaknesses.
ACMgen is an automatic code generator of Asynchronous Communications Mechanisms based on the generation of Petri nets models that can be formally verified against some properties and then transformed into a real implementation (e.g. C++ or Verilog).
This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library supports the 26 genetic operators. This is cross-platform GA written in С++.
The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.
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.
"Blue Planet" is a research project simulating the behaviour and darwinian evolution of unicellular lifeforms, each controlled by its own genetic program. Moreover, "Blue Planet Inhabitants" are suited for swarm intelligence and swarm research.
Framework: Project for Evolutionary Predator Prey Algorithms, used to implement an evolutionary scheme based on the developement by van Laumanns. Implement testproblems, special behaviours, environments, and other yet not known features.
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! :)
Contains various algorithms that maps short reads produced from Illumina (Solexa) Genome Analyzer, or Applied Biosystems' SOLiD System, to a reference sequence or a set of reference sequences.