Showing 6 open source projects for "algorithm finder"

View related business solutions
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini 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.
    Start Free
  • 1
    CRC RevEng

    CRC RevEng

    Arbitrary-precision CRC calculator and algorithm finder

    CRC RevEng is a portable, arbitrary-precision CRC calculator and algorithm finder. It calculates CRCs using any of the 113 preset algorithms, or a user-specified algorithm to any width. It calculates reversed CRCs to give the bit pattern that produces a desired forward CRC. CRC RevEng also reverse-engineers any CRC algorithm from sufficient correctly formatted message-CRC pairs and optional known parameters.
    Leader badge
    Downloads: 339 This Week
    Last Update:
    See Project
  • 2
    This package includes a collection of MATLAB files which are designed to: 1. Given a calibration scan of the image of a point emitter with an engineered point spread function (PSF), 2. Perform a phase retrieval algorithm based on maximum likelihood estimation (MLE) of a phase aberration term which is added to the theoretical pupil function of the imaging system. 3. Use the phase-retrieved pupil function to perform single-emitter localization. Accompanying publication available here:...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    A star

    it is an implementation of A* algorithm with examples of its usage.

    A start (A*) is the algorithm for searching the shortest path in the weighted graphs. My implementation is provided with various interesting applications, i.e. 15 puzzle. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/shortest-path-graph-a-star/ For detail of A* algorithm see wiki page: https://en.wikipedia.org/wiki/A*_search_algorithm
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    D-finder is a bioinformatic search algorithm for the identification of D-sites in JNK interacting proteins. The algorithm is a combination of pattern matching and a hidden markov model (HMM) based on a training set of known JNK D-sites.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 99.99% Uptime for MySQL and PostgreSQL Databases Icon
    99.99% Uptime for MySQL and PostgreSQL Databases

    Sub-second maintenance. 2x read/write performance. Built-in vector search for AI apps.

    Cloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
    Start Free
  • 5
    ChIPOTle is a peak-finding algorithm used to analyze ChIP-chip microarray data
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    The Tandem Repeat Occurrence Locator -- TROLL -- is a light weight SSR finder based on a slight modification of the Aho-Corasick algorithm.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next