Search Results for "performance"
Sort By:
Showing 45 open source projects for "performance"
View related business solutions-
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
1
Algebraic graphs
Algebraic graphs
...Alga can handle graphs comprising millions of vertices and billions of edges in a matter of seconds, which is fast enough for many applications. We believe there is a lot of potential for improving the performance of the library, and this is one of our top priorities. If you come across a performance issue when using the library, please let us know. -
2
Swift Numerics
Advanced mathematical types and functions for Swift
...The package includes RealModule utilities and a full Complex type with the expected arithmetic and transcendental functions, bridging a long-standing gap for numerics in Swift. API design follows Swift’s emphasis on value semantics and protocol-oriented programming, enabling compiler optimizations and predictable performance. The modules are factored to keep dependencies minimal and to allow adopters to pull in only what they need. As a result, Swift Numerics underpins higher-level libraries in simulation, signal processing, and machine learning written in pure Swift. -
3
DifferentialEquations.jl
Multi-language suite for high-performance solvers of equations
This is a suite for numerically solving differential equations written in Julia and available for use in Julia, Python, and R. The purpose of this package is to supply efficient Julia implementations of solvers for various differential equations. The well-optimized DifferentialEquations solvers benchmark as some of the fastest implementations, using classic algorithms and ones from recent research which routinely outperform the “standard” C/Fortran methods, and include algorithms optimized... -
4
OrdinaryDiffEq.jl
High performance ordinary differential equation (ODE)
This is a suite for numerically solving differential equations written in Julia and available for use in Julia, Python, and R. The purpose of this package is to supply efficient Julia implementations of solvers for various differential equations. The well-optimized DifferentialEquations solvers benchmark as some of the fastest implementations, using classic algorithms and ones from recent research that routinely outperform the “standard” C/Fortran methods, and include algorithms optimized... -
$300 Free Credits for Your Google Cloud ProjectsLaunch 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.
-
5
Benchee
Easy and extensible benchmarking in Elixir
Library for easy and nice (micro) benchmarking in Elixir. Benchee allows you to compare the performance of different pieces of code at a glance. It is also versatile and extensible, relying only on functions. There are also a bunch of plugins to draw pretty graphs and more! Benchee runs each of your functions for a given amount of time after an initial warmup, it then measures their run time and optionally memory consumption. It then shows different statistical values like average, standard deviation etc. ... -
6
Gonum
Set of numeric libraries for the Go programming language
...Gonum contains libraries for matrices and linear algebra; statistics, probability distributions, and sampling; tools for function differentiation, integration, and optimization; network creation and analysis; and more. We encourage you to get started with Go and Gonum if you are tired of sluggish performance, and fighting C and vectorization, and also if you are struggling with managing programs as they grow larger. Get Gonum if you want code to be fully transparent, and want the ability to read the source code you use. It is useful if you’d like a compiler to catch mistakes early, but hate fighting linker and unintelligible compile errors. -
7
half
C++ library for half precision floating point arithmetics.
This is a C++ header-only library to provide an IEEE-754 conformant half-precision floating point type along with corresponding arithmetic operators, type conversions and common mathematical functions. It aims for both efficiency and ease of use, trying to accurately mimic the behaviour of the builtin floating point types at the best performance possible. It automatically uses and provides C++11 features when possible, but stays completely C++98-compatible when neccessary. -
8
Data Envelopment Analysis using Stata
Unified Data Envelopment Analysis commands for Stata
DEAS provides Data Envelopment Analysis tools for Stata. Version 2.0 is a major update centered on a unified dea command for Stata 16 or later. It consolidates sixteen DEA model families into one interface, keeps backward compatibility with the original inputs = outputs syntax, and adds a fast Mata two-phase revised simplex engine alongside Stata's LinearProgram() IPM engine. The package supports radial technical efficiency (CCR/BCC), SBM, additive model, radial and SBM super-efficiency,... -
9
Digraph3
A collection of python3 modules for Algorithmic Decision Theory
...Technical documentation and tutorials are available under the following link: https://digraph3.readthedocs.io/en/latest/ The tutorials introduce the main objects like digraphs, outranking digraphs and performance tableaux. There is also a tutorial provided on undirected graphs. Some tutorials are problem oriented and show how to compute the winner of an election, how to build a best choice recommendation, or how to linearly rank or rate with multiple incommensurable performance criteria. Other tutorials concern more specifically operational aspects of computing maximal independent sets (MISs) and kernels in graphs and digraphs. -
Stop Cyber Threats with VM-Series Next-Gen Firewall on AzureGain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
-
10
NAVAL-SEM
Free offline SEM software with HTMT, bootstrapping & exports
NAVAL-SEM is a free, open-source, fully offline desktop application for Structural Equation Modeling (SEM), supporting both PLS-SEM and CB-SEM workflows. Designed for researchers, PhD scholars, professors, students, and analysts, it enables advanced quantitative research without subscriptions, cloud dependencies, or proprietary software restrictions. Key features include visual drag-and-drop model building, bootstrapping, mediation analysis, HTMT, AVE, Composite Reliability (CR),... -
11
PI-Based Image Encoder / Converter
Python code able to convert / compress image to PI (3.14, π) Indexes
...Power Management set as High Performance .. in Balanced is slow) -
12
Generic data-assimilation toolbox written in java, with native (c and fortran) libraries for high performance computing. Provides tools to couple to your own model and a wide range of algorithms, ranging from parameter calibration to Kalman filters.
-
13
GeoRegression
An open source Java geometry library with a focus on 2D/3D space.
...GeoRegression provides the ability to estimate the closest point/distance between geometric primitives, best-fit shapes, and best fit geometric transform between sets of objects. It is designed for high performance and ease of use. GeoRegression has been release under an LGPL license for both commercial and non-commercial use. -
14
...Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack
-
15
Finite Transform Library
A Library is for Finite Transforms
The Library is for Finite Transforms such as the Number Theoretic Transform (NTT) and Finite Radon Transform (FRT). Current modules include NTTW for NTTs with high resolution (microsecond) timing, basic array and imaging. The transforms are optimised for performance. -
16
mep4j
Math Expression Parser 4 Java
Math Expression Parser 4 Java MEP4J is a high performance math expression strings parser for Java (J2SE >= 5). Compare its performance against similiar libraries and let me know your experince. The library manages the 5 operators (+, -, /, %, *) together with the following functions: - "abs" - "cos" - "sin" - "acos" - "asin" - "cosh" - "sinh" - "tan", - "tanh" - "atan" - "sqrt" - "cbrt" - "root" - "log" - "log10" - "log1p" - "exp" - "expm1" - "atan2" - "pow" The library supports variables (case insensitive), custom and pre-loaded ("e" and "pi"). ... -
17
MathFu
C++ math library developed primarily for games focused on simplicity
...Implementations are carefully tuned to leverage SIMD instruction sets such as SSE and NEON while preserving a clean fallback path for portability. Because types are fixed at compile time, the compiler can aggressively inline and unroll code, producing predictable performance and tiny binaries. The design emphasizes minimal dependencies and clear ownership so the library can be embedded into engines without dragging in heavyweight frameworks. It fits equally well in rendering math, physics helpers, animation blending, and camera control logic where determinism and speed matter. -
18
LAMA
Heterogeneous Software Development Accelerated
...LAMA's modular and extensible software design supports the developer on several levels, regardless of whether writing his own portable code with the Heterogeneous Computing Development Kit or using prepared functionality from the Linear Algebra Package, the user always gains high productivity and maximum performance. -
19
runjags
The 'runjags' R package and standalone JAGS extension module
This package provides high-level interface utilities for MCMC models via Just Another Gibbs Sampler (JAGS), facilitating the use of parallel (or distributed) processors for multiple chains, automated control of convergence and sample length diagnostics, and evaluation of the performance of a model using drop-k validation or against simulated data. Template model specifications can be generated using a standard lme4-style formula interface to assist users less familiar with the BUGS syntax. A JAGS extension module provides additional distributions including the Pareto family of distributions, the DuMouchel prior and the half-Cauchy prior. -
20
ViennaCL
Linear algebra and solver library using CUDA, OpenCL, and OpenMP
ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects. -
21
as3delaunay
Delaunay triangulation and Voronoi diagram for Flash Builder 4 project
...By handling complex geometric relationships automatically, it simplifies the process of building interactive or data-driven visualizations. The project emphasizes performance and mathematical accuracy while maintaining readability for developers working in ActionScript. Its codebase serves as a reliable foundation for anyone implementing geometry-based algorithms or graphical systems within AS3 projects. -
22
Fingerprint Recognition System
Fingerprint Recognition System 5.3 - Matlab source code
...We are able to achieve a verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms published in the open literature. Our system performs better than a state-of-the-art minutiae-based system when the performance requirement of the application system does not demand a very low false acceptance rate. Finally, we show that the matching performance can be improved by combining the decisions of the matchers based on complementary (minutiae-based and filter-based) fingerprint information. Index Terms: Biometrics, FingerCode, fingerprints, flow pattern, Gabor filters, matching, texture, verification. -
23
wmtsa-python
Discrete wavelet methods for time series analysis using python
...This module started as translation of the wmtsa Matlab toolbox (http://www.atmos.washington.edu/~wmtsa/), so most naming conventions and most of the code structure follows their choices. The code uses a mix of python and cython for improved performance. The code reflects my needs and preferences, but contributions from others are welcome. The code has to some extent been tested, but bugs are to be expected. -
24
TIDES
Taylor series Integrator for Differential Equations
...TIDES tutorial: Integrating ODEs by using the Taylor Series Method., Monografías de la Academia de Ciencias de la Universidad de Zaragoza. 36, pp. 1-116. * R. Barrio, 2005. Performance of the Taylor series method for ODEs/DAEs, Appl. Math. Comput. 163 (2), pp. 525--545 * R. Barrio, 2006. Sensitivity analysis of ODE's/DAE's using the Taylor series method, SIAM J. on Scientific Computing 27 (6), pp. 1929--1947 -
25
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
...The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large)
