3 projects for "work" with 2 filters applied:

  • Try Google Cloud Risk-Free With $300 in Credit Icon
    Try Google Cloud Risk-Free With $300 in Credit

    No hidden charges. No surprise bills. Cancel anytime.

    Use your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
    Start Free
  • Enterprise-grade ITSM, for every business Icon
    Enterprise-grade ITSM, for every business

    Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.

    Freshservice 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.
    Try it Free
  • 1
    ...It uses any external archiver such as Winrar, 7-zip or gzip for compress and may rotate files in GNU/Linux logrotate's style. Program works in any OS such as Windows, Linux, Unix, Mac OS, etc, where Python may work. Dependencies: - Python v2.6 or better v2.7 (v2.5 for pyrotate v0.8 or earlier) - an external archiver Russian: Программа для ротации и/или архивации логов (и любых других) файлов, которая использует любой внешний архиватор и может ротировать файлы в стиле Линуксовой программы logrotate в любой ОС, где работает интерпретатор языка Python. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    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
  • Previous
  • You're on page 1
  • Next
MongoDB Logo MongoDB