Search Results for "form code"
Sort By:
Showing 8 open source projects for "form code"
View related business solutions-
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
1
Candle
GRBL controller application with G-Code visualizer written in Qt
GRBL controller application with G-Code visualizer written in Qt. -
2
Pluto.jl
Simple reactive notebooks for Julia plutojl.org
We are on a mission to make scientific computing more accessible and fun. Writing a notebook is not just about writing the final document, Pluto empowers the experiments and discoveries that are essential to getting there. -
3
Automa.jl
A julia code generator for regular expressions
Automa is a regex-to-Julia compiler. By compiling regex to Julia code in the form of Expr objects, Automa provides facilities to create efficient and robust regex-based lexers, tokenizers and parsers using Julia's metaprogramming capabilities. You can view Automa as a regex engine that can insert arbitrary Julia code into its input-matching process, which will be executed when certain parts of the regex match an input. -
4
city-roads
Visualization of all roads within any city
city-roads is a data visualization and mapping project that renders street networks of cities as vector paths, offering an interactive, zoomable experience that highlights how cities are stitched together by their road infrastructure. It typically fetches open map data (such as from OpenStreetMap) and then processes that data into geometry suited for rendering in the browser, allowing users to explore intricate road layouts at various scales. The visual style often abstracts away labels and... -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
Bayesian Statistics
This repository holds slides and code for a full Bayesian statistics
This repository holds slides and code for a full Bayesian statistics graduate course. Bayesian statistics is an approach to inferential statistics based on Bayes' theorem, where available knowledge about parameters in a statistical model is updated with the information in observed data. The background knowledge is expressed as a prior distribution and combined with observational data in the form of a likelihood function to determine the posterior distribution. -
6
Gridap.jl
Grid-based approximation of partial differential equations in Julia
Gridap provides a set of tools for the grid-based approximation of partial differential equations (PDEs) written in the Julia programming language. The library currently supports linear and nonlinear PDE systems for scalar and vector fields, single and multi-field problems, conforming and nonconforming finite element (FE) discretizations, on structured and unstructured meshes of simplices and n-cubes. It also provides methods for time integration. Gridap is extensible and modular. One can... -
7
Bayesian Julia
Bayesian Statistics using Julia and Turing
Bayesian statistics is an approach to inferential statistics based on Bayes' theorem, where available knowledge about parameters in a statistical model is updated with the information in observed data. The background knowledge is expressed as a prior distribution and combined with observational data in the form of a likelihood function to determine the posterior distribution. The posterior can also be used for making predictions about future events. Bayesian statistics is a departure from... -
8
libCEED
CEED Library: Code for Efficient Extensible Discretizations
libCEED provides fast algebra for element-based discretizations, designed for performance portability, run-time flexibility, and clean embedding in higher-level libraries and applications. It offers a C99 interface as well as bindings for Fortran, Python, Julia, and Rust. While our focus is on high-order finite elements, the approach is mostly algebraic and thus applicable to other discretizations in factored form, as explained in the user manual and API implementation portion of the...
- Previous
- You're on page 1
- Next