Showing 7 open source projects for "c call tree"

View related business solutions
  • MongoDB Atlas runs apps anywhere Icon
    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.
    Start Free
  • Go From AI Idea to AI App Fast Icon
    Go From AI Idea to AI App Fast

    One platform to build, fine-tune, and deploy ML models. No MLOps team required.

    Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
    Try Free
  • 1

    Text Zip

    This software zips and unzips a text file

    This software zips and unzips a .txt file, using the Huffman encoding algorithm and the list and tree data structures. The result files are named zippedFile.txt and unzippedFile.txt and can be found at the same directory as the Text Zip executable file.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    Huffman Stuff

    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/
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    libarxx is a C++ archiver with advanced features, like data synchronization and merging of multiple archives. It provides an object-oriented view on a directory tree of data items and allows versioning, compressing and structuring in multiple ways.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 4
    Alternative approach to minimum redundancy coding (fixed-length) without using tree data structures. The main advantages are simplicity and flexibility.
    Downloads: 0 This Week
    Last Update:
    See Project
  • $300 in Free Credit Towards Top Cloud Services Icon
    $300 in Free Credit Towards Top Cloud Services

    Build VMs, containers, AI, databases, storage—all in one place.

    Start your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
    Get Started
  • 5
    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(
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    garchiver is an archiver for Gnome. It has a tree interface that lets you navigate through your archives very easily, as well as the classic WinZip interface. It also has full drag and drop support.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next
MongoDB Logo MongoDB