Showing 4 open source projects for "asm"

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
  • $300 Free Credits for Your Google Cloud Projects Icon
    $300 Free Credits for Your Google Cloud Projects

    Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

    Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
    Start Free Trial
  • 1
    UoMASM

    UoMASM

    A C++ Active Shape Model Library from the University of Manchester

    A library and associated tools for building and searching with Active Shape Models (ASM). It builds on the VXL computer vision libraries. Includes a GUI tool to search new images with the ASM. Depends on: VXL, Qt (Version 4), UoMqVXL
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2

    Approximate Subgraph Matching Algorithm

    Approximate Subgraph Matching Algorithm for Dependency Graphs

    ...Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). 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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    There you will find my works of different sets of asm libs like "Still Mpeg Assembly Decompressor" , "LZW16 compressor & decompressor for lzw16 & gif" , "Lzss de/compressor similiar to aplib,upx etc but faster&better de/compression" , "Jpeg decode lib" ,
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    This is an attempt to use Genetic Programming for writing a go player in a pseudo-ASM. It is entirely written in Common Lisp.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
    Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

    General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

    Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
    Try Free
  • Previous
  • You're on page 1
  • Next
Auth0 Logo