Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.
Build generative AI apps with Vertex AI. Switch between models without switching platforms.
Start Free
AI-generated apps that pass security review
Stop waiting on engineering. Build production-ready internal tools with AI—on your company data, in your cloud.
Retool 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.
Major looseless compression algorithms library and documentation. First project: Arithmetic, Huffman, LZ77, LZ78, LZW, RLE. Second project reimplements Deflate. Documentation explains major Entropy Compression Methods.
TER implements the CCSDS Recommendation for Image Data Compression (CCSDS 122.0-B-1). TER also adds new features to the Recommendation. TER is designed and programmed with the aim to provide a good basis to test and develop the CCSDS Recommendation.
Dreamfiler is a scanned documents and images organizer. It is ideal for offices and workstations that need easy storage and retrieval of important images or scanned documents for daily use. Use tags for easy recollection of data stored via images.
Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.
Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
I want to test some ways to store the data for the Huffman Tree
Lectures on Huffman Code mostly focus on creating the Huffman Tree and converting the given data into the new bitmap. But what about the informations needed to create the Huffman Tree? They must be stored as well. With this project I want to test some possibilities to store these data.
gmp,h is needed to compile.
See: http://gmplib.org/
CADI is an implementation of the JPIP standard (JPEG2000 Interactive Protocol - Part 9). CADI includes a JPIP server, a JPIP proxy, and a JPIP Client. CADI is designed and programmed with the aim to provide a flexible framework to test and develop ne
KGB Archiver is the compression tool with unbelievable high compression rate. It surpasses even such efficient compression tool like 7zip and UHARC in terms of the abilities. KGB Archiver uses AES-256 encryption to encrypt archives.
The algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode message. Built tree is n-ary one.The algorithm is based on a set of template classes : Cell(SYMBOL, WEIGHT), Node(
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.
jzip is a zipping/archiving program, written in Java. It let's user use gui to create zip archives and Jar executables archives. The very fact that it is using Java allows use on many platforms.
Infinity is a fractal compressor (based on high mathematical theories) done by a university assigment. It will be based on neural networks (an innovative approach) and coded in C++