Showing 22 open source projects for "algorithm finder"

View related business solutions
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • Keep company data safe with Chrome Enterprise Icon
    Keep company data safe with Chrome Enterprise

    Protect your business with AI policies and data loss prevention in the browser

    Make AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
    Download Chrome
  • 1
    crypto wallet finder

    crypto wallet finder

    Wallet Finder, Recover lost crypto across major blockchains.

    "Wallet Finder – Cryptocurrency Wallet Maker & Balance Locator for Lost Bitcoin (BTC), Ethereum (ETH), BNB, Polygon (MATIC), EVM-Compatible Chains & Bitcoin Wallet Recovery" Unlike Python-based brute-force tools, Wallet Finder is built in C++ and tuned for multi-threaded CPU and GPU workloads, delivering up to 10× faster throughput. Because true randomness doesn’t exist in computing—only pseudo-randomness—deterministic wallet generation can exhibit patterns and possible vulnerabilities....
    Leader badge
    Downloads: 126 This Week
    Last Update:
    See Project
  • 2
    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: 93 This Week
    Last Update:
    See Project
  • 3
    ...This ~2500 lines Pure C factorization software : - is imediately compatible with Microsoft Windows, Linux (no one dependancy) - is a C99 command line factorizer from 0 to 300 bits (330 bits were factored in the lab) - is built so that you can easily use and test the software - use its own "big num" library named cint - use AVL trees to organize information - use Lanczos Block, a pure C iterative matrix eigenvalues finder algorithm - use Pollard's Rho algorithm to answer under 64 bits The Microsoft Windows executable is included in the zip, the readme.md gives you details. Small and larger RSA numbers have been factored by the software, such as the 100 decimal digit number RSA-100. The software factored the 321-bit RSA number relating to the "bank card case".
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    Approximate Solution Finder

    Approximate Solution Finder

    An open-source approximate logic design tool

    We provide an open-source library of approximate multipliers described using Verilog HDL. The article related to the library is currently under review.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Cloud-based help desk software with ServoDesk Icon
    Cloud-based help desk software with ServoDesk

    Full access to Enterprise features. No credit card required.

    What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
    Try ServoDesk for free
  • 5
    wisp

    wisp

    Wisp - A preference based location finder app

    The work of finding the best place according to user preference is tedious task. It needs manual research and lot of intuitive processes to find the best location according to some earlier knowledge about the place. It is mainly about accessing publicly available spatial data, applying a simple algorithm to summarise the data according to given preferences, and visualising the result on a map. We introduced JJCluster to eliminate the rigorous way of researching about a place and visualizing...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6

    Path Finder Qt

    finds the sortest path on the square board. GUI is implemented in Qt.

    The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed. In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. For every modification of the board, the shortest path is calculated automatically. Some statistics...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7

    Shortest Path Graph A star

    finds the sortest path on the directed graph using A* algorithm.

    It is the implementation of the A* algorithm for directed graph. Additionally, the implementation of the Graph is provided. For visualization of the graph and the results of the A* algorithm the data are exported in GraphViz (Graph Visualization Software) format: http://www.graphviz.org/ Various exemplary solutions are provided. See also my other two projects related to A* algorithm: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/a-star/
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    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
  • 9

    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
  • All-in-one security tool helps you prevent ransomware and breaches. Icon
    All-in-one security tool helps you prevent ransomware and breaches.

    SIEM + Detection and Response for IT Teams

    Blumira’s detection and response platform enables faster resolution of threats to help you stop ransomware attacks and prevent data breaches. We surface real threats, providing meaningful findings so you know what to prioritize. With our 3-step rapid response, you can automatically block known threats, use our playbooks for easy remediation, or contact our security team for additional guidance. Our responsive security team helps with onboarding, triage and ongoing consultations to continuously help your organization improve your security coverage.
    Learn More
  • 10
    Intelligent Keyword Miner

    Intelligent Keyword Miner

    Intelligent SEO keyword miner and predicing tool

    ...This program is intelligent as it predicts what you may want to search next, based on your personal trends. After searching the suggestions, you can choose to reset or train it further. Programs that have similar idea are: Google AdWords, SERPWoo's Keyword Finder, Wordpot, and others. Difference is, this program is intelligent and it accepts your input data and then predicts keywords based on your likes or dislikes. As the main engine, it uses the SMOReg algorithm to analyze and map the keyword frequencies of your data. This can be a great SEO tool to help increase the traffic of any website featuring a product.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11

    SpeakerFinder

    Speaker Identification

    Speaker Finder is speaker identification tool powered by 3 different technique in the background . 1 - GMM with GFCC (gammatone filter ceptral coefficient) 2 - GMM with Pitch(f0) 3 - NGrams with f0 SpeakerFinder should be trained with speaker's sound first than, program can be used the recognized trained speakers. Project also has a validation phase which choose which algorithm above 3 will give best result for spesific speaker.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    Duplicate Files Finder is a cross-platform application for finding and removing duplicate files by deleting, creating hardlinks or creating symbolic links. A special algorithm minimizes the amount of data read from disk, so the program is very fast.
    Downloads: 46 This Week
    Last Update:
    See Project
  • 13

    Prime-Number-Finder

    Prime Number Finder usign Sieve of Eratosthenes

    Program by: Ravi Sharma (rvisharma) Prime-Number-Finder-using-Sieve-of-Eratosthenes =============================================== Finds Prime Numbers using Sieve of Eratosthenes Algorithm This Program gives you the prime number upto N Integers, Sieve of Eratosthenes Algorithm is used to determine the Prime Number To find the Prime Number, in the console Shell call the prime_finder(N) function, prime number will be given upto N integer. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14

    qlsdup

    GUI based lightweight duplicate file finder / remover.

    Simple GUI based lightweight duplicate file finder and remover. Configurable file search and preview (via external tools) option for file data. No command-line interface available! This is basically a reimplementation of dupfinder as: it doesn't compile on my computer, the executable won't work either, the projects seems dead and I didn't wanna work through the original code.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    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: 1 This Week
    Last Update:
    See Project
  • 16
    ChIPOTle is a peak-finding algorithm used to analyze ChIP-chip microarray data
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    C++ implementation of the ZVTOP vertex finding algorithm for linear collider studies.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    This program is based on a algorithm that solves a Master Mind combination. The algo seems to work but without hole and with 5 different colors in an atempt.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    GD is AI - ALife becoming true. It's a genetic engine server, capable to run any kind of genetic algorithm. It has TCP architetcure, working with software clients and uman interaction. It has plugin capabilities and comes with a working Function Finder
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    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
  • 21

    Hill Finder

    Detection of Proximal RNA Binding Sites in HITS Data

    High-throughput sequencing has been widely used to find novel protein-binding RNAs, utilizing methods such as CLIP-Seq and Genomic SELEX. Typical analyses of the high-throughput data employ the use of a histogram of the aligned read count per base, the intensity of which indicates, for a specific region of an RNA, the underlying sequence's relative occurrence of binding events in the experiment. This technique can, however, obscure the precise locations of binding sites in close proximity to...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    It's an implementation of the A* algorithm together with a grid processor which pre-processes 8-bit bpm graphic files using a variable resolution and an SDL user interface to test it.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next