Search Results for "algorithm" - Page 40
Sort By:
Showing 1992 open source projects for "algorithm"
View related business solutions-
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
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.
-
1
Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml
-
2
Sudoku Solver
Sudoku solving library using bruce-force search algorithm
The SudokuSolver class inside this library is simple and easy-to-use. It uses the bruce-force search algorithm to solve the Sudoku appeared on daily newspapers, books, etc. Continual updates to this library give you easier experiences with Sudoku solving, and can solve other sorts of Sudokus. -
3
EkNN
Extracting k nearest neighbors for point cloud
Speed up kNN searching algorithm by extracting nearest neighbors diectly other than searching them one by one -
4
Cake
A bioinformatic tools for somatic mutation discovery
Cake, a bioinformatics software pipeline that integrates four publicly available somatic variant-calling algorithms to identify single nucleotide variants with higher sensitivity and accuracy than any one algorithm alone. Cake can be run on a high-performance computer cluster or used as a stand-alone application For additional information on how to obtain and run Cake, updates and known issues please visit the wiki page https://sourceforge.net/p/cakesomatic/wiki/Cake%20Somatic/ -
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.
-
5
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively... -
6
cCNN
A fast implementation of LeCun's convolutional neural network
Code of this library is partialy based on myCNN MATLAB class written by Nikolay Chemurin. -
7
Cerulean Hybrid Genome Assembler v0.1 Cerulean extends contigs assembled using short read datasets like Illumina paired-end reads using long reads like PacBio RS long reads. Cerulean v0.1 has been implemented with bacterial genomes in mind. I am not able to maintain and update the software due to change in research funding. However I will be happy to answer any queries or provide support and comments if you are interested in extending this algorithm. The method is fully described...
-
8
Molecular Measurer
Parallel, Stochastic Measurement of Molecular Surface Area
A program to measure molecular surface area. The algorithm is GPU-accelerated using CUDA and is described in the research paper linked from the project home page. The input to the program is xyzr files, which can be generated from pdb files. -
9
J! Secure Password Hashes provided an easy access to all Joomla! password hash algorithms and the Drupal 7 SHA-512 hashing algorithm. Compatible: Joomla! 2.5.
-
Picsart Enterprise Background Removal API for Stunning eCommerce VisualsWith our Remove Background API tool, you can access the transformative capabilities of automation , which will allow you to turn any photo asset into compelling product imagery. With elevated visuals quality on your digital platforms, you can captivate your audience, and therefore achieve higher engagement and sales.
-
10
SeleSup is a simple and fast algorithm (O(n^2)) for reducing the training cardinality of data sets through the elimination of irrelevant instances by mimicking the self-regulatory and suppression mechanism found in the immune system.
-
11
The utility sfxcompress is a bash script used to pack and encrypt the current directory on a self-extracting file. It also includes the calculation of the MD5 function to check if the compressed file is correct.
-
12
sqlite3fish
Another encryption solution (with Blowfish algorithm) for SQLite3
The sqlite3fish is another encryption solution for sqlite3. It is based on some source code of botansqlite3(https://github.com/OlivierJG/botansqlite3) . But it does not need Botan library, it uses Blowfish algorithm to encrypt/decrypt the database file. This library only depends on the source code(no-modify) of SQLite3, it is clean and easy to compile. But currently it only supports the version 3.7.0 of SQLite3 (http://www.sqlite.org/sqlite-amalgamation-3_7_0.zip) . -
13
QSAR Kennard Stone
Kennard Stone algorithm based division
The purpose of this program is to perform rational selection of training and test set based on Kennard Stone algorithm: -
14
mrCaNaVaR is a more user friendly and faster re-implementation of our previously published algorithm together with the mrFAST/mrsFAST/drFAST read mapping programs to discover large segmental duplications and deletions and predicts absolute copy numbers.
-
15
This is the former home of pyecm, which has now been moved to github: https://github.com/martingkelly/pyecm Pyecm factors large integers (up to 50 digits) using the Elliptic Curve Method (ECM), a fast factoring algorithm.
-
16
DNAcompact
Genome compression algorithm with/without reference (Linux/Windows)
As the technique of acquiring genome sequences advances, the storage and data transferring of large genome data are becoming important concerns for biomedical researchers. We propose a two pass genome compression algorithm, which highlights the synthesis of complementary contextual models and the introduction of logistic regression mixture method, to improve the compression performance. The proposed framework handles genome compression with and without reference seque- nces, and demonstrated... -
17
GestureDetect
Gesture detection with Kinect+OpenNI+Unity3D
... devices. To acquire skeleton data, we uses OpenNI 1.5.4 because it is an open source library. The scripts in the project are written in c#. The algorithm we use is template matching. The structure of the code is clear and not very complicated. If you want to use it on other platforms, you may pick part of the scripts in the "GestureScripts" folder and try to edit them to fit other SDKs or platforms. The usage and algorithm introduction are also provided. Try it and have fun! -
18
StFFT
FFT on Structured text
Fast fourier transform algorithm written on IEC-61131-3 Structured text programming language for programmable logic controllers. Algorithm is split-radix FFT. StFFT is iterative contrary to more common recursive approach. Iterative solution was chosen because PLCs don't have support for recursion. For compatibility with as many as possible PLC models, algorithm have dependency only on sine and cosine functions. Dual licenced under LGPL and Commercial licence. For commercial licencing... -
19
Shobhit-Improved String Search
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/4) and in worst case, time complexity is O(n – (m/4) ). In all the cases... -
20
Modus - C++ Music Library
Cross-platform C++ library to handle music from code
Modus is an open source, cross-platform C++ library which allows you to handle music from code. This means that you can: * Manage interactive and adaptive music * Use some kind of algorithm to improvise * Represent visually (simulate) musical performances * Select in real time the instruments that are going to play a previously written song * Let the user take part on the performance through any type of interface, by playing an instrument, changing the tempo, choosing... -
21
OpenAIL
Open Artificial Intelligence Library
[Open Artificial Intelligence Library]. This library main goal is to provide a tool box to those who want to use algorithm such as neural network or genetics Algorithm and all algorithms that are commonly within the Artificial Intelligence field. -
22
AHANNS
AHANNS - Amateur Homemade Artificial Neural Network Simulator
AHANNS enables the user to create and train artificial neural networks. Training is carried out by an implementation of back propagation learning algorithm. See the documentation for details. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope -
23
SHOBHIT-Advance String Search
SHOBHIT-Advance String Search is a pattern search Algorithm
In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and worst... -
24
CAPLET
GDS visualization and parallelized capacitance extraction
Project CAPLET is a capacitance extraction toolkit that extract capacitance at field-solver accuracy. CAPLET can directly handle GDS2 layout files into capacitance matrices in both GUI and command line interfaces. The internal extraction algorithm is specialized for VLSI interconnect structures but not exclusively, as long as the structure is of Manhattan geometry and embedded in a uniform dielectric material. -
25
Nand2Tetris - TicTacToe
Tic Tac Toe Game for the Nand2Tetris Project
This is an implementation of the classic Tic Tac Toe game on the Hack computer as part of the Nand2Tetris project. The game features a 1 or 2-player mode with a computer-controlled player for single player games. The computer AI uses a 'minimax' algorithm and has 3 levels of difficulty - the Impossible mode is unbeatable!
