Stereo-image depth reconstruction with different matching costs and matching algorithms in Python using Numpy and Numba
-
Updated
Jul 2, 2023 - Python
Stereo-image depth reconstruction with different matching costs and matching algorithms in Python using Numpy and Numba
A Julia package for the computation of hard, theoretically guaranteed bounds on the moments of jump-diffusion processes with polynomial data
An open source first-order MATLAB solver for conic programs with row sparsity.
Analysis of Variance (ANOVA)
MATLAB code with examples of SOS chordal decomposition for polynomial matrix inequalities with sparsity
A sum-of-squares toolbox for stability analysis
PRoTECT is an open-source software tool, with a user-friendly GUI, for the purposes of formal verification using polynomial-type barrier certificates for safety specifications. PRoTECT can handle discrete-time stochastic systems, continuous-time stochastic systems, discrete-time deterministic systems and continuous-time deterministic systems.
A proof of Fermat's theorem on sum of two squares with mathcom using gaussian integers.
Computing approximate optimal designs for multivariate polynomial regressions
Code for the paper "Minimum wave speeds in monostable reaction-diffusion equations: sharp bounds by polynomial optimization"
Code for the paper "The speed of traveling waves in a FKPP-Burgers system"
A Python tool for calculating the sum of squares of integers, useful for mathematical computations and analysis.
Using Sum-of-squares hierarchies to solve the Total Variation norm minimization
The code produces Stock price model in a discrete time line and Running sum-of-square returns
Assignment-07-K-Means-Clustering-Airlines. Perform clustering (K means clustering) for the airlines data to obtain optimum number of clusters. Draw the inferences from the clusters obtained. The file EastWestAirlinescontains information on passengers who belong to an airline’s frequent flier program. For each passenger the data include informati…
Unsupervised-ML---K-Means-Clustering-Non-Hierarchical-Clustering-Univ. Use Elbow Graph to find optimum number of clusters (K value) from K values range. The K-means algorithm aims to choose centroids that minimise the inertia, or within-cluster sum-of-squares criterion WCSS. Plot K values range vs WCSS to get Elbow graph for choosing K (no. of c…
Some BigInt usage examples in D
PROGRAMMING PARADIGMS
Add a description, image, and links to the sum-of-squares topic page so that developers can more easily learn about it.
To associate your repository with the sum-of-squares topic, visit your repo's landing page and select "manage topics."