Search Results for "scientific"
Sort By:
Showing 7 open source projects for "scientific"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
1
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.
-
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
SEG-Y files need special compression because they don't compress well using gzip and the like. The code is cross-platform C++ using nothing else than standard system libraries. This is a spin-off from the OpendTect project (http://opendtect.org).
-
4
PyramidWorkshop is an image-compression System based upon the scientific work of John Robinson (inventor of BTPC) about image-compression with adaptive linear predictors and is in average more efficient than PNG/JPEG2000.
-
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
5
StormRT is a real-time multi-resolution analysis and compression package for data compression and temporal feature detection over multiple timescales.
-
6
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(
-
7
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
