Search Results for "polynomial" - Page 2
Sort By:
Showing 75 open source projects for "polynomial"
View related business solutions-
Build Agents and Models on One PlatformGemini 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.
-
$300 Free Credits to Build on Google CloudPut 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.
-
1
GSMLBook
Recipes for basic machine learning algorithms using sklearn in jupyter
...The emphasis is primarily on learning to use existing libraries such as Scikit-Learn with easy recipes and existing data files that can found on-line. Topics include linear, multilinear, polynomial, stepwise, lasso, ridge, and logistic regression; ROC curves and measures of binary classification; nonlinear regression (including an introduction to gradient descent); classification and regression trees; random forests; neural networks; probabilistic methods (KNN, naive Bayes', QDA, LDA); dimensionality reduction with PCA; support vector machines; and clustering with K-Means, hierarchical, and DBScan. ... -
2
Polynomial System Solver
pss5 is a polynomial system solver, under development.
The objective of this project is to build a general-purpose polynomials system solver. While a few of those programs are available, this one will incorporate recent mathematical advances on mixed volume computations, sparse condition numbers and condition-metric homotopy. -
3
BigDecimal
Arithmetic and calculus with decimal numbers of arbitrary precision.
BigDecimal is a C # library that uses System.Numerics.BigInteger in its implementation, adding only a decimal place quantizer. In BigDecimal all the arithmetic operations are implemented, including, logarithms, systems resolution of linear equations, trigonometric functions, polynomial regression, hyperbolic functions, the notorious gamma function (factorial for non-integer real numbers) and more that will be implemented still. My intention is, at a minimum, to implement all the mathematical functions of the Windows calculator, and at most, if any, all the mathematical functions of Office Excel. -
4
Retop Math Library
A Java Math Library for creating advanced programs
Regression Polynomial Regression Noise generator Advanced Matrix and Vector classes Physics Collisions Window to visualize functions -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
SparesPOP is a MATLAB implementation of a sparse semidefinite programming (SDP) relaxation method proposed for polynomial optimization problems (POPs). Please send a message to kojima-spop@is.titech.ac.jp if you have any question and/or request. We also release SparsePOPC++ and SparsePOPC++-windows. Both implementations are SparsePOP which does not use MATLAB, but only C++. In particular, SparsePOPC++-windows contains a binary file which works on Windows, and does not require to compile.
-
6
Chebfun
Chebfun: numerical computing with functions
Chebfun is a MATLAB-based system for numerical computing with functions instead of just numbers. It represents functions using Chebyshev polynomial approximations and allows users to perform operations like differentiation, integration, root finding, and solving ODEs using symbolic-like syntax. Chebfun simplifies working with continuous mathematics using high-accuracy numerical techniques. -
7
C++11 implementation of the Galois Field of two to the power M, GF(2^M), as well as polynomial ring over GF(2^M).
-
8
Graphic creator
Application for creating graphics
This app can be create graphic from 3 ways : 1) String function ("x^2+sin(x)) 2) Polynomial (1,0,0 -> x^2) 3) Lagrange's interpolation (set dots to build graphic) You can be create 2 graphic (in next version maybe >2 ) and solve equation f(x) = g(x) -
9
Graph isomorphism algorithm
Graph isomorphism algorithm in polynomial complexity
Graph isomorphism algorithm in polynomial complexity(O(n*n*n). it consume less than 1 second to judge Graph of 800 vertice in general. -
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.
-
10
MattsMathTools
MathTools is an aid in preparing printed math tests.
Matt's MathTools is a Java application designed as an aid in preparing printed math tests. It is easily embedded in other Java applications or it can be used alone as a single-user desktop app. It includes a scripting environment, numerous demonstration classes and several general utilities. A scripting tutorial is also available. -
11
pure python polyfit
python2/3: compute polyfit (1D, 2D, N-D) without thirdparty libraries
python2/3: compute polyfit (1D, 2D, N-D) without any thirdparty library like numpy, scipy etc. also can be used for least squares solution computation and for A=QR matrix decomposition. Tested with python 2.7 and 3.4 Consider donating to this project: https://sourceforge.net/p/purepythonpolyfit/donation For a Sample use, refer to the WIKI -
12
ReedSolomon
Fast Java implementation of Reed Solomon coding
...This mini project was born out of frustration at not being able to find a decent performing Java Reed-Solomon implementation. Only symbol sizes <= 8 are supported in this port. And testing has been performed only with GF(256) and polynomial 0x11d. As the original code was GNU Lesser General Public License (LGPL), this derivative work shall fall under LGPL as well. -
13
traph
A tool for transcript identification and quantification with RNA-Seq
Traph is a novel tool for transcript identification and quantification with RNA-Seq data, based on minimum-cost flows. Our method has a two-fold advantage: on the one hand, it translates the problem as an established one in the field of network flows, which can be solved in polynomial time, with different existing solvers; on the other hand, it is general enough to encompass many of the previous proposals under the least sum of squares model. -
14
fusie
Fuzzy scala inference engine
Rewriting from Java to Scala and improving my university project on course Artifical Intelligence Systems. About project in russian: http://brunneng.blogspot.com/2013/06/fuzzy-scala-inference-engine-fusie.html Can be used from maven: <dependency> <groupId>net.sf.brunneng.fusie</groupId> <artifactId>fusie</artifactId> <version>0.8.1</version> </dependency> -
15
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. -
16
Algebraic Numbers
Visualization of the first few algebraic numbers
This is inspired by http://en.wikipedia.org/wiki/File:Algebraicszoom.png with some source code (especially the polynomial generating algorithm!) taken from http://en.wikipedia.org/wiki/User:Stephen_J._Brooks/algebraics/src -
17
Standcurve
Standcurve performs standard curve analysis
The purpose of this program is to calculate unknown by a standard curve. It uses polynomial least square fitting to get the equation and apply the equation to evaluate unknown. It was developed on Linux and runs on Linux and Windows. -
18
Genetic Polynomials
genetic algorithm to approximate a set of points with polynomial
genetic algorithm to approximate a set of points with polynomial -
19
Respol: A software package for computing projections of resultant polytopes Description: Respol is C++ software to compute a projection of the Newton polytope of the resultant of a given polynomial system. These are indirectly defined high-dimensional polytopes. Related Papers: [1] I.Z.Emiris, V.Fisikopoulos, C.Konaxis, L.Peñaranda. An oracle-based, output sensitive algorithm for projections of resultant polytopes. International J. Computational Geometry & Applications (Special issue) World Scientific, 2013. [2] I.Z.Emiris, V.Fisikopoulos, C.Konaxis, L.Peñaranda. ...
-
20
CS-AMPPred
The Cysteine-Stabilized Antimicrobial Peptides Predictor
...The support vector machine models were based on 310 antimicrobial peptide sequences extracted from antimicrobial peptides database and 310 non-antimicrobial peptide sequences extracted from protein data bank. The system's accuracy is 90% by using the polynomial model (default). -
21
Griso is a graph isomorphism testing utility written in C++. It is based on my own POLYNOMIAL-TIME (in this point the salt of the project) algorithm. See Griso's sample input/output on http://funkybee.narod.ru/graphs.htm page. Edit (2012-10-24): seems so far it works for *regular graphs only* and should be tested on such graphs. Edit (2012-10-25): see two counterexamples in README.txt. But yet if Griso's verdict is "NON-isomorphic" it's 100% correct, so you can still make use of it. ...
-
22
locsmoc
piecewise polynomial curves for genomic signals
Locsmoc produces piecewise polynomial models for one-dimensional signals of the type encountered in genomics. The project wiki contains an overview of the tool and usage examples. -
23
SymbolicC++
An object oriented C++ library for computer algebra
SymbolicC++ is a general purpose computer algebra system embedded in the programming language C++. It is free software released under the terms of the GNU General Public License. SymbolicC++ is used by including a C++ header file or by linking against a library. -
24
MEPCM Package
This is a package for multi-element probabilistic collocation method.
...This package can generate high-dimensional stochastic collocation points based on tensor product rule, non-nested sparse grids method or anchored-ANOVA method. It can also be used for the multi-element probabilistic polynomial chaos method. -
25
Software for making Clusters of Orthologous Groups (featuring the new EdgeSearch algorithm). Latest ref: Kristensen DM, Kannan L, Coleman MK, Wolf YI, Sorokin A, Koonin EV, Mushegian A. Bioinformatics 2010.