Search Results for "performance" - Page 2
Sort By:
Showing 61 open source projects for "performance"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
LightSpMV
lightweight GPU-based sparse matrix-vector multiplication (SpMV)
LightSpMV is a novel CUDA-compatible sparse matrix-vector multiplication (SpMv) algorithm using the standard compressed sparse row (CSR) storage format. We have evaluated LightSpMV using various sparse matrices and further compared it to the CSR-based SpMV subprograms in the state-of-the-art CUSP and cuSPARSE. Performance evaluation reveals that on a single Tesla K40c GPU, LightSpMV is superior to both CUSP and cuSPARSE, with a speedup of up to 2.60 and 2.63 over CUSP, and up to 1.93 and 1.79 over cuSPARSE for single and double precision, respectively. -
2
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. -
3
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. -
4
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. -
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
5
...The idea is to provide Scientists, Engineers, Researchers and other non full-time programmers an easy to use, high performance library of functions.
-
6
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 -
7
Colt provides a set of Open Source Libraries for High Performance Scientific and Technical Computing in Java http://acs.lbl.gov/~hoschek/colt/ This project starteda as a port of the Colt core library to C#, but contains additional features.
-
8
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) -
9
ViennaGrid is a generic mesh handling library that provides the traversal of structured and unstructured grids in arbitrary spatial dimensions, in particular 1d, 2d and 3d. Quantities can be conveniently stored on mesh elements using ViennaData.
-
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
FreDec
Parallelized FREquency DEComposer algorithm
...In the end, it prints out the set of largest frequency tuples that were still found significant. The GPU computing is implemented through CUDA and brings a significant performance increase. It is still possible to run FreDec solely on CPU, if no suitable GPU device is available in the system. See the details of the underlying theory in Baluev 2013, MNRAS, V. 436, P. 807 The description of the algorithm itself can be found in arXiv:1309.0100. Please go to the project forum to report any bugs. -
11
TMVA Toolkit for Multi Variate Analysis
A ROOT-integrated toolkit for multivariate analysis
TMVA is a ROOT-integrated toolkit for multivariate classification and regression analysis. TMVA performs the training, testing and performance evaluation of a large variety of multivariate methods. Since 2013, TMVA has been fully integrated with ROOT and is distributed as part of it. The new homepage of TMVA is https://root.cern -
12
Javafastcomplex
Javafastcomplex has both mutable and immutable complex numbers
...Javafastcomplex implements both mutable and immutable complex numbers, and has a common interface for both, allowing users to write functions that can take either a mutable or an immutable complex number as an argument. Mutable complex numbers can then be used in the most performance-critical parts of the code with immutable complex numbers being used elsewhere. Performance improvement of mutable complex numbers is 10x in the best-case scenario and about 2x in real life complex number code. The package is released under the liberal MIT license. -
13
...We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.
-
14
parFE is fully-parallel high-performance finite element code targeted to the modeling of trabecular bones in humans. It employs scalable multigrid solvers for efficient solutions on massively parallel computers.
-
15
Java Micro Benchmark - control tasks required to determine the comparative performance characteristics of the computer system on different platforms. Can be used to determine the effect of different software on the performance of a computer system.
-
16
JTransforms is the first, open source, multithreaded FFT library written in pure Java. Benchmark results show better performance than FFTW. The latest version is available at http://github.com/wendykierp/JTransforms.
-
17
A declarative logic programming system with first-class relations embedded in a pure functional subset of Scheme. The system has true unions, fair scheduling, lexically-scoped logical variables, set-theoretical semantics, high performance without cuts
-
18
...It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.
-
19
This software is a computer program whose purpose is to fortran mathematics library and some solve linear equation in high performance computing. I create this software for for my last year of engineer school (Scientific Computing Option)
-
20
Parallel Colt is a multithreaded version of Colt - a library for high performance scientific computing in Java. It contains efficient algorithms for data analysis, linear algebra, multi-dimensional arrays, Fourier transforms, statistics and histogramming
-
21
This is my first attempt at building a reusable framework for 3D applications (not an engine!), primarily for educational purpose and also because none of the already existing tools did satisfy me. No longer maintained.
-
22
LAPACK++ is a library for high performance linear algebra computations. This version includes support for solving linear systems using LU, Cholesky, QR matrix factorizations, for real and complex matrices.
-
23
Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.
-
24
BSPonMPI is an implementation of the BSPlib standard on top of MPI. Both MPI and BSPlib are API's of communication routines meant for parallel computing, but BSPlib is easier to learn and its performance easier to predict.
-
25
Goldy is a very fast C++ expression templates library for scientific and engineering computing that implements explicit SSE instructions and delivers performance compatible with native C/FORTRAN code.
