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
Train ML Models With SQL You Already Know
BigQuery automates data prep, analysis, and predictions with built-in AI assistance.
Build and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
Implementation of the LZW algorithm in C#, adhering to the built-in System.IO.Compression.
The algorithm and code is much improved, compared to projects like SharpLZW.
The LZW algorithm is for arbitrary lossless data compression and are noticeable for simplicity and low (compared to others) memory consumption. Making it interesting for eg. embedded use.
There're many other LZW implementations out there. This one is focused on KISS and C#.
[2014-10-31] This project is obsolete, for latest version (6.1.3) see GitHub https://github.com/digital-preservation/droid (source) and http://www.nationalarchives.gov.uk/information-management/manage-information/preserving-digital-records/droid/ (binary)
DROID (Digital Record Object Identification) is an automatic file format identification tool. It is the first in a planned series of tools developed by The National Archives under the umbrella of its PRONOM technical registry service.
[2013-01-24] The binary download of the latest version of DROID has now been moved to The National Archives website: http://www.nationalarchives.gov.uk/information-management/projects-and-work/droid.htm
The source code for the latest version of DROID remains available via Github: http://digital-preservation.github.com/droid/
[2012-09-07] DROID 6.1 has been released. ...
Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.
ctsplit is a program designed to split a large binary file into smaller byte sized pieces. Included with this project will be source code, linux binaries, windows binaries, User interface (using QT), and documentation.
Languages: C++ and QT