Search Results for "algorithm" - Page 44
Sort By:
Showing 2943 open source projects for "algorithm"
View related business solutions-
Build Data Resilience - Take the Assessment TodayIs your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
-
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
1
High Performance SW to Searching in a Large Forensic DNA Bank. It performs the Needleman-Wunsch algorithm in order to determine the individuals identity.
-
2
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. -
3
Cortex Beacon
Ham Radio QRP(P) Beacon on Cortex-M3 MCU from STMicroelectronics.
TODO -
4
cl-string-match
String matching algorithms implementation for Lisp
Common Lisp provides a SEARCH function to lookup given keys in a string, but its implementation can be subotimal: it can be beaten in some cases by even the simpliest brute-force algorithm. This project is aimed at implementing robust string matching algorithms for Common Lisp. -
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
freeDatamap
FreeDatamap spatializes the map of your organization’s data.
...You can browse a big bunch of data by going through any desired node and discover its underlying data. This makes freeDatamap ideal for exploring large datasets. FreeDatamap does analytics. Thanks to a fast and powerful aggregation algorithm, remote relationships can be bridged through a unified view from where you can navigate and drill down from macro data to micro. FreeDatamap delivers a fast and visually attractive user interface that runs on any support: computers, tablets or phones. Features list : • Unlimited users : full web 2.0 application • Data visualization : one centralized trusted map for all your data • Workflow and business process visualization • Search capabilities • Report creation • Advanced analytics • Data mining • Dashboard, gauges, alerts -
6
CUDA-Quicksort
CUDA-Quicksort: A GPU-based implementation of the quicksort algorithm
CUDA-quicksort is a GPU-based implementation of the quicksort algorithm. CUDA-quicksort is designed to exploit the power computing of modern NVIDIA GPUs. "Two GPU-based implementations of the quicksort were presented in literature: the GPU-quicksort, a compute-unified device architecture (CUDA) iterative implementation, and the CUDA dynamic parallel (CDP) quicksort, a recursive implementation provided by NVIDIA Corporation."[*]. -
7
Object detection is usually a software-based monitoring algorithm that will signal, for example in the surveillance camera to begin capturing the event when it detects motion. In object tracking, the object is located and the moving object is followed. One of the fundamental steps in many computer based vision systems for object tracking and motion detection is real-time segmentation of moving regions in the image sequences.
-
8
NOFI ranking
The Non-Outlier Fragment Ion ranking for enhaced DIA quantification
The NOFI ranking algorithm has been developed to assign low priority to fragment ions affected by interference. The implementation is an R script that can be customized. A future version will contain a modular version. The outline is as follows: 1) The input contains the list of SWATH fragment ion XICs from the identified and quantified peptides by software tools such as Skyline and OpenSWATH. 2) The first step in NOFI is the computation of the 4 attributes (RTd, FWHMd, IRd and IRrep) used to represent each fragment ion as a vector. 3) Multivariate outlier detection techniques are used to rank all the fragment ions from each peptide. 4) Several figures are generated (a pdf file) to visualize the effect of the Top-N fragment ions over different indicators. 5) The user can choose the number of top fragment ions per peptide, thereby utilizing the optimal subset of high priority Top-N NOFIs for quantification while excluding the impaired fragment ions. -
9
-
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
10
JAABA
The Janelia Automated Animal Behavior Annotator
...JAABA uses machine learning techniques to convert these manual labels into behavior detectors that can then be used to automatically classify the behaviors of animals in large data sets with high throughput. JAABA combines an intuitive graphical user interface, a fast and powerful machine learning algorithm, and visualizations of the classifier into an interactive, usable system for creating automatic behavior detectors. Documentation is available at: http://jaaba.sourceforge.net/ -
11
Constrained Ellipse Fitting
MATLAB Code for Constrained Ellipse Fitting with Center on a Line
...The usage of this constraint in a new global convergent one-dimensional search problem ("Tunneling") improves the fitting accuracy compared to other ellipse fitting methods. You can find more details on the theoretical background of the presented algorithm here: http://doi.org/10.1007/s10851-015-0584-x If you use the code please cite our paper: Waibel, P; Matthes, J.; Gröll, L; Constrained Ellipse Fitting with Center on a Line; Journal of Mathematical Imaging and Vision; November 2015, Volume 53, Issue 3, pp 364-382 -
12
PW Generator
Password generator per site base on a single password
Try to develop a password generating algorithm and front-end using c# and .NET framework. Per site password with variaous options and fixed result. Use for make and find password. Easy to use. -
13
The `fmtt` formatter
A plain text formatter for typescripts.
... - Uses Unicode internally, reads and writes 8-bit oder UTF-8 encoded files. - Recognizes preformatted paragraphs (eg source code, tables). - Reformats paragraphs either using the traditional greedy line breaking algorithm, or a TeX-like optimizing algorithm. -
14
...Some Key features of the tool are.... (1) Configured for 4 open source algorithms to perform database searching for peptide identification. Any combination of the 4 algorithm can be chosen. (2) Lists out the genome search specific peptides(Novel peptides). (3) Spectral matches can be visualized for the quality assessment. (4) Lists out the novel proteins and changes in the existing protein annotations. (5) A Visual genomic context of the novel peptides can also be generated.
-
15
BreakSeek
A breakpoint-based algorithm for full spectral range INDEL detection
BreakSeek is a breakpoint-based algorithm for full spectral range INDEL detection, which can unbiasedly and efficiently detect both homozygous and heterozygous INDELs, ranging from several base pairs to over thousands of base pairs, with accurate breakpoint and heterozygosity rate estimations. -
16
qcv
Computer Vision Framework Library (for Linux)
...The C interface is a set of simple function calls to allow the user to visualize data and obtain events from the system and user input. The C++ interface has more features allowing the user to run and analyze complex computer vision algorithm in a few lines of code (see the stereo and surf examples). QCV offers a 2D visualization tool, an on-line on-the-fly parameter editor, a clock tool to evaluate computation times, and a control tool to manipulate input video and sequences of images. Multiple application examples that demonstrate the main features of this framework are provided in the last release. ... -
17
SoftSV
Calling structural variations. The soft way.
...It uses aberrant paired-end mappings to determine approximative breakpoint regions and refines the breakpoints by analysing soft-clipped sequences for potential split-reads. For more information about the algorithm and an evaluation, have a look at this publication: "Robust and exact structural variation detection with paired-end and soft-clipped alignments: SoftSV compared with eight algorithms" (PMID 25998133) Please cite this artilce if you used SoftSV in your publication. -
18
TicTacToe
Tic Tac Toe game with clever computer player
...The AI has two settings: dumb and intelligent. The dump setting places tokens by random, the intelligent setting plays the best possible move by running a MiniMax algorithm. The executable requires the LabVIEW Run-Time Engine 2014 - (32-bit) available for download here: http://ftp.ni.com/support/softlib/labview/labview_runtime/2014/Windows/f2/LVRTE2014f2std_downloader.exe -
19
ObjectDetector
Car Detection,Face Detectiom,Object Detection
Machine learning: This project is used for training new object like Car,Motor Cycle and so on and we use this model(xml file) for detecting in images.In this project we use viola jones algorithm. -
20
Chemin Optimal
allow to Find the optimal path using FORD algorithm
Chemin optimal allows to draw nodes on a scene and link them with Arcs. You can affect values to each arc (the path's length). By clicking the launch button, chemin optimal show you the optimal path of the graphs using FORD algorithm. All operations are shown step by step. You can export the scene to a XML file. You can also load scene freom existing XML file. Chemin optimal check errors automatically before finding the minimal path. Chemin optimal is written in JAVA( JAVAFX ). -
21
libCudaOptimize
A Parallel Optimization library with CUDA
LibCudaOptimize is a GPU-based open source library that allows you to run state-of-the-art bio-inspired optimization heuristics in parallel to optimize a fitness function, introduce a new optimization algorithm, or easily modify/extend existing ones. -
22
Enigma_3
A substitution-based encryption algorithm for binary data or text
Enigma3 is a substitution-based encryption algorithm that can be applied to binary or text data and results in far greater security than traditional encryption. An electronic dictionary of words is employed and numeric codes are then assigned to each word within the dictionary. Communications are coded as a set of numeric codes which can then only be translated back into the original message by using the original coded dictionary. -
23
NCrypted
NCrypted - simple file encryption software with GPU support
NCrypted is a simple file encryption software. It is implemented on top of AES 128-bit algorithm. This software was designed to be as simple as possible, so you won't find any fancy, flashy gui elements or complicated advanced options. You can also use it directly from command line. NCrypted can automatically detect and take advantage of your NVidia graphics card to speed up the file processing. -
24
...Use multiple files in multiple formats to align them with their translations. The full workflow is built in with a GUI interface. SuperAlign-eAlign uses the hunalign algorithm.
-
25
SpherePacking
Packing of spheres in a round cell
Packing spheres densely inside a larger sphere. The algorithm was described in details in this paper (2004) "Random close packing of spheres in a round cell" http://www.sciencedirect.com/science/article/pii/S0022309303007695 Dependency GNU scientific library
