Showing 165 open source projects for "two"

View related business solutions
  • Build Agents and Models on One Platform Icon
    Build Agents and Models on One Platform

    Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

    Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
    Try It Free
  • Compliant and Reliable File Transfers Backed by Top Security Certifications Icon
    Compliant and Reliable File Transfers Backed by Top Security Certifications

    Cerberus FTP Server delivers SOC 2 Type II certified security and FIPS 140-2 validated encryption.

    Stop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
    Start Free Trial
  • 1
    SourceAFIS

    SourceAFIS

    Fingerprint recognition library (.NET port)

    SourceAFIS is a software library for human fingerprint recognition. It can compare two fingerprints 1:1 or search a large database for matching fingerprint. It takes raw fingerprint images on input and produces matching score on output. Click the website link above for more info.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    vectorFormat

    vectorFormat

    c++ header file including classes and functions for vector mathematics

    Very soon, development of vectorFormat will be resumed.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Image Sorter

    Image Sorter

    A visual animated demonstration of two sorting algorithms

    An applet designed to demonstrate visually the steps taken by two sorting algorithms -- Insertion sort and Selection sort.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4

    AlgART Java Libraries

    Open source library for processing arrays and matrices

    AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Stop vibe-debugging. Icon
    Stop vibe-debugging.

    Plug Claude into your app's actual errors.

    AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
    Free 30 days.
  • 5
    Math tools in Python to tackle down problems in Operational Research fields. Comes with a Django based web interface to allow remote access to complex simulation means.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6
    I Language
    I is a cross-platform programming language designed towards efficiency during development and at runtime.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    Haskellesque lazy-list and functional tools with a Common Lisp slant.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    ...We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9

    Approximate Subgraph Matching Algorithm

    Approximate Subgraph Matching Algorithm for Dependency Graphs

    ...We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Build Securely on AWS with Proven Frameworks Icon
    Build Securely on AWS with Proven Frameworks

    Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.

    Moving 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.
    Download Now
  • 10

    quadGT

    Software package for the joint genotyping

    quadGT is a software package for the joint genotyping of two parents, child’s normal genome and child’s tumor genome based on sequencing reads aligned to a reference genome.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    HL72XML Transformer
    HL7 to XML Transformation toolkit. Using HL7 v2 XML
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12

    Exact Subgraph Matching Algorithm

    Exact Subgraph Matching Algorithm for Dependency Graphs

    The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. This Java implementation implements our ESM algorithm. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13

    Wittgen

    WIttgen is a two-instruction programming language modeled on the mind.

    The Wittgen programming language consists of just two instructions and one special variable name. Wittgen allows you to assign any text string to a variable of any name. It also allows you to retrieve the text assigned to that variable. Lastly, it has a special variable called “Doing Now”. Every execution step consists of retrieving the contents of Doing Now, removing the first assign found in that content and performing that assign.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14

    db4o-sp

    Spatial extension for db4o.

    Master's Project: Object Database Spatial Extension. API based on SQL/MM Spatial. Full technical report is available in download section.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    BayesianCortex

    BayesianCortex

    simple algorithm for a realtime interactive visual cortex for painting

    A paint program where the canvas is the visual cortex of a simple kind of artificial intelligence. You paint with the mouse into its dreams and it responds by changing what you painted gradually. There will also be an API for using it with other programs as a general high-dimensional space. Each pixel's brightness is its own dimension. Bayesian nodes have exactly 3 childs because that is all thats needed to do NAND in a fuzzy way as Bayes' Rule which is NAND at certain extremes. NAND can be...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    Genetic Algorithms Library (in Java)

    Genetic Algorithms Library (in Java)

    An API for Java developers who need Genetic Algorithms

    ...GeneticTrial.zip contains another netbeans project which is an example explaining how to use the API. docs.zip is the documentation of the API. Please take a look there, it is really helpful. I have only two request from who will use this API; USE, UPDATE AND MODIFY IT FREELY JUST NOTE THE ORIGINAL AUTHOR
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17

    ssSearchEngine

    keyword search engine for semi-structured data (Tables, lists,...)

    This application implement an approach for doing keyword based search over semi-structured data available in HTML pages.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    Belkerda

    Belkerda

    a customizable number-guessing system

    Belkerda is a simple Python AI program that takes a user's input, builds a log of random numbers, picks a random entry, and displays it. If it is correct, then it reenters that number back into the log several times, overwriting the original, random numbers. If it is not, however, it overwrites a lower amount of entries.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    The Movinator is a movie database application. It manages information about movies plus ratings assigned to movies by movie critics. Based on these ratings and user ratings, the application can also make movie recommendations.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    Software to solve Linear Programming problems applying the Revised Simplex Algorithm (2-Phase Method) and performing a Sensitivity Analysis too.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    Dieser Parser, soll arithmetische Ausdrücke, die als String vorliegen, ausrechnen, bzw. diverse Funktionen darauf anwenden können. Bis jetzt kann er nur Audrücke wie "4^(5+2)-23*4/cos(3)" ausrechnen. er unterstützt auch vergleichsoperatoren
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22

    JScriptCompiler

    JScript Compiler or Interpreter

    The class 'JSEvaluator' in this project allows us to interpret expressions in JScript, allowing us to use parameters in the server at runtime. For example: ({@ 1} + {@ 2}) / 100; Parameter {@ 1} : 36 Parameter {@ 2}: 45 Result of the expression: 0.81
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23

    Zero Sum Game Solver Java Library

    Zero Sum Game Solver Java Library

    Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25
    JavaFrameApplet is a generic base in Java for Applet in JFrame games!
    Downloads: 0 This Week
    Last Update:
    See Project
Auth0 Logo