Showing 2 open source projects for "high performance computing"

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
  • 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.
    Start Free
  • 1
    RBush

    RBush

    High-performance JavaScript R-tree-based 2D spatial index

    RBush is a high-performance JavaScript library for 2D spatial indexing of points and rectangles. It's based on an optimized R-tree data structure with bulk insertion support. Spatial index is a special data structure for points and rectangles that allows you to perform queries like "all items within this bounding box" very efficiently (e.g. hundreds of times faster than looping over all items).
    Downloads: 2 This Week
    Last Update:
    See Project
  • 2
    Supervised Reptile

    Supervised Reptile

    Code for the paper "On First-Order Meta-Learning Algorithms"

    ...The fundamental idea is: sample a task, train on that task (inner loop), and then move the initialization parameters toward the adapted parameters (outer loop). Because Reptile is a first-order algorithm, it avoids computing second derivatives or full meta-gradients, making it computationally simpler while retaining good performance. The repo includes training scripts, dataset fetchers (Omniglot, Mini-ImageNet), and modules for defining the Reptile update logic, variables, and hyperparameters.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next