Search Results for "algorithm"
Sort By:
Showing 23 open source projects for "algorithm"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
MongoDB Atlas | Run databases anywhereMongoDB Atlas allows you to build and run modern applications across 125+ cloud regions, spanning AWS, Azure, and Google Cloud. Its multi-cloud clusters enable seamless data distribution and automated failover between cloud providers, ensuring high availability and flexibility without added complexity.
-
1
Blueprint XAS is a Matlab-based suite designed for the processing and analysis of near-edge x-ray absorption spectroscopy (XAS) data. The suite is designed primarily to assist users in exploring reasonable fit solutions while minimizing user bias.
-
2
MAGeCK
Model-based Analysis of Genome-wide CRISPR-Cas9 Knockout
Model-based Analysis of Genome-wide CRISPR-Cas9 Knockout (MAGeCK) is a computational tool to identify important genes from the recent genome-scale CRISPR-Cas9 knockout screens technology. For instructions and documentations, please refer to the wiki page. MAGeCK is developed by Wei Li and Han Xu from Dr. Xiaole Shirley Liu's lab at Dana-Farber Cancer Institute/Harvard School of Public Health, and is maintained by Wei Li lab at Children's National Medical Center. We thank the support... -
3
A2RMS Algorithm
Implementation of the A2RMS Algorithm in Matlab
Implementation of the A2RMS Algorithm for univariate densities defined for real values. -
4
Tsf_Mdnnhn
Time Series Forecasting.
Implementation of algorithm allowing Time Series Forecasting. -
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
-
5
TimescapeGlobal
a space-time interpolation geostatistical tool
This software is a time-aware geostatistical tool. Including time variability adds further issues to the already complicated field of geostatistical interpolation. On the other hand, most of the distributions of variables used in Earth and environmental sciences show patterns of change over time, not only in space. This tool is a free, open-source software, based on a generalization of the Inverse Distance Weighted algorithm. It outputs three-dimensional, layered discrete models from which... -
6
The purpose of this program is to provide the user with a convenient algorithm for automatic Independent Component (IC) selection with respect to the contributions of the ICs to a certain event-related brain potential (ERP). www.jan-wessel.de
-
7
Community Detection Modularity Suite
Suite of community detection algorithms based on Modularity
- MixtureModel_v1r1: overlapping community algorithm [3], which includes novel partition density and fuzzy modularity metrics. - OpenMP versions of algorithms in [1] are available to download. - Main suite containing three community detection algorithms based on the Modularity measure containing: Geodesic and Random Walk edge Betweenness [1] and Spectral Modularity [2]. Collaborator: Theologos Kotsos. [1] M. Newman & M. Girvan, Physical Review, E 69 (026113), 2004. [2] M. Newman... -
8
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... -
9
GADfit
Global nonlinear optimization with automatic differentiation
NOTE: Development continued at GitHub! Current version is higher than 1.2.0. GADfit is a Fortran implementation of global nonlinear curve fitting, based on a modified Levenberg-Marquardt algorithm. Global fitting refers to fitting many datasets simultaneously with some parameters shared among the datasets. The fitting procedure is very fast and accurate thanks to the use of automatic differentiation. The model curves (fitting functions) can be of essentially arbitrary complexity... -
Powering the best of the internet | FastlyEnsure your websites, applications and services can effortlessly handle the demands of your users with Fastly. Fastly’s portfolio is designed to be highly performant, personalized and secure while seamlessly scaling to support your growth.
-
10
Chinese I Ching R Algorithms
Chinese I Ching Algorithms implemented with R programming
... these algorithms with statistical programming. Overcoming the long span has important meanings. First, we can verify the validity of algorithm with big data. Second, we can put them into unprecedented wide application in the age of data. Third, the unique inspection of I Ching that linked "all the universe" open new eyes for us in thought and methodology about interdisciplinary use of data. This program is open-source for human. If you are interested in it, welcome to discuss and work together. -
11
mathSuite
Powerful Calculus Environment and Matrices Handling Engine
mathSuite is a very powerful Mathematical Suite which deals principally with complex algebric and geometric operations. It is powered by the fabulous ExprEval C Parser. The main purpose of this project is fast math-oriented algorithm virtualization, with an optimized direct text interface. Also it gives you a very powerful and fast Calculus Environment which let you handle easily interchangeable variable lists, matrices, LOGS and Settings Layouts with optimized Items Lists Managing Engine... -
12
PhEq_bootstrap
FDA's f2 computation with bootstrap technique
This program was developed as a help in establishing pharmaceutical equivalence by use of FDA f2 coefficient. It was designed to help with f2 computation in cases when intra- and inter-batch variability is large, namely RSD>10%. The use of statistical bootstrap technique allows to implement confidence interval (CI) into the f2 coefficients resulting in overcoming of their major drawback in the original metrics. The algorithm provides possible “worst case scenario” of f2 values, thus supporting... -
13
MRA
A general recommender system with basic models and MRA
Multi-categorization Recommendation Adjusting (MRA) is to optimize the results of recommendation based on traditional(basic) recommendation models, through introducing objective category information and taking use of the feature that users always get the habits of preferring certain categories. Besides this, there are two advantages of this improved model: 1) it can be easily applied to any kind of existing recommendation models. And 2) a controller is set in this improved model to provide... -
14
FreDec
Parallelized FREquency DEComposer algorithm
This is a parallelized algorithm performing a decomposition of the time-series data into a number of sinusoidal components, disentangling them from the white Gaussian noise. The algorithm analyses all suspicious frequencies, including the ones that look like an alias at a glance, but may become preferable later. After selection of the initial frequency candidates, the algorithm passes through all their possible combinations and estimates their multi-frequency statistical significance... -
15
libfgen
Library for optimization using a genetic algorithm or particle swarms
libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported. -
16
segment
Solve the Viterbi algorithm in a data stream
It is often necessary to assign a series of discrete values to continuosly variable data sequenced by time, position, etc., thereby parsing the data into fewer and larger segments of variable width. The 'segment' utility takes an input data stream as a Hidden Markov Model and applies the Viterbi algorithm to find the most likely segmentation path through the data. -
17
CvHMM
Discrete Hidden Markov Models based on OpenCV
This project (CvHMM) is an implementation of discrete Hidden Markov Models (HMM) based on OpenCV. It is simple to understand and simple to use. The Zip file contains one header for the implementation and one main.cpp file for a demonstration of how it works. Hope it becomes useful for your projects. -
18
BIL++ is a set of standalone C++ packages for data processing in Bioinformatics (Graph mining, Bayesian networks, Genetic algorithm, Discretization, Gene expression data analysis, Hypothesis testing).
-
19
The TreeRank project is a R package implementing a Machine Learning algorithm to build tree-based ranking rules from data with binary labels, based on ROC optimization.
-
20
Optimization tool that mimics the darwinian reproduction, selection, mutation process. It has 2 components: the optimization algorithm and an interpretar to define function to optimize and constraints. It is all written in java (netbeans).
-
21
This project aims to provide open source software implementing the Wedge algorithm for the estimation of parameters in dynamical systems models. This project also seeks to create tutorials and resources for those using Wedge.
-
22
PGAF provides a framework tuned, user-specific genetic algorithms by handling I/O, UI, and parallelism. It is designed for optimizing functions that take a "very long time" to evaluate.
-
23
The CRISP package here developed utilizes an algorithm that describes a many-body intranuclear cascade (INC) and evaporation/fission/multifragmentation competition process.
- Previous
- You're on page 1
- Next
