Search Results for "binary"
Sort By:
Showing 5 open source projects for "binary"
View related business solutions-
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
1
diffpak
A huge files block differential compressor
A differential compresor (or a binary diff) for huge files. Unlike other tools, e.g. xdelta3, it searches for matching data through the whole source file, even if it weights several gigabytes, while using much less memory (with default configuration approx 25x less than the size of the source file). Output files are not compressed, so you can use any compressor you like with great results. -
2
Slim is a data compression system for scientific data sets, a binary and a library with C linkage. Slim works with integer data from one or more channels in a file, which it can compress more effectively and more rapidly than general tools like gzip.
-
3
This is a fast binary compression/decompression method based on byte translation through a numerical order sequence that demonstrates the speed and efficiency of binary compression. (http://www.jasenko.com.mk)
-
4
Fast and efficient proprietary bit reordering compression. Usefull for compressing binary-text files. Uses binary vectors reordering and dynamic data dictionary. (http://www.jasenko.com.mk)
-
Enterprise-grade ITSM, for every businessFreshservice 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.
-
5
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.
- Previous
- You're on page 1
- Next
