Search Results for "algorithm" - Page 11
Sort By:
Showing 514 open source projects for "algorithm"
View related business solutions-
Cloud-based help desk software with ServoDeskWhat if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
-
eProcurement SoftwareeBuyerAssist by Eyvo is a cloud-based procurement solution designed for businesses of all sizes and industries. Fully modular and scalable, it streamlines the entire procurement lifecycle—from requisition to fulfillment. The platform includes powerful tools for strategic sourcing, supplier management, warehouse operations, and contract oversight. Additional modules cover purchase orders, approval workflows, inventory and asset management, customer orders, budget control, cost accounting, invoice matching, vendor credit checks, and risk analysis. eBuyerAssist centralizes all procurement functions into a single, easy-to-use system—improving visibility, control, and efficiency across your organization. Whether you're aiming to reduce costs, enhance compliance, or align procurement with broader business goals, eBuyerAssist helps you get there faster, smarter, and with measurable results.
-
1
Extract Objects from Image
Connected Component Labeling Algorithm - Extracting Objects From image
fast Connected Component Labeling Algorithm - java application - Extracting Objects From image -
2
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... -
3
XOR encrypt v2.0
Encrypt Your Text documents with XOR encryption
...Besides from XOR'ing the message with password after every encryption the key changes pseudorandomly. The password you provide is hashed ( SHA256 ) and saved into the encrypted file to check if the password provided is correct.This algorithm has limitations in general more the numbers of relative characters in the password to plaintext more secure will be the encryption. XOR encrypt has a 3.5 of 5 editors rating from softpedia http://www.softpedia.com/get/Security/Encrypting/XOR-Encrypt.shtml -
4
PyVision Computer Vision Toolkit
A Python computer vision library
PyVision is a object-oriented Computer Vision Toolkit for researchers that contains vision and machine learning algorithms and algorithm analysis and easily interfaces with scipy/numpy, PIL, opencv and other computer and machine learning libraries. -
Award-Winning Medical Office Software Designed for Your SpecialtyRXNT is an ambulatory healthcare technology pioneer that empowers medical practices and healthcare organizations to succeed and scale through innovative, data-backed, AI-powered software.
-
5
Distributed Multithread Apriori (DMTA)
A parallel implementation using MPI and OpenMP to Apriori algorithm
DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira, in Department of Computer Science at Federal University of Lavras. ... -
6
...The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. Each module is provided with an example program.
-
7
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
...It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. 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. ... -
8
A pure C library translated from C++ Standard Template Library(STL), intended to be used as a STL like(container + iterator + algorithm) library in any C compatible environment.
-
9
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
...The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
Teradata VantageCloud Enterprise is a data analytics platform for performing advanced analytics on AWS, Azure, and Google Cloud.VantageCloud is the complete cloud analytics and data platform, delivering harmonized data and Trusted AI for all. Built for performance, flexibility, and openness, VantageCloud enables organizations to unify diverse data sources, run complex analytics, and deploy AI models—all within a single, scalable platform.
-
10
JCycles
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later. -
11
libcontc
Container library in C.
About Collection of data structures and operations that have been (and will continue to be) implemented in response to need. Container interface, naming and behavior is similar to the STL containers. Algorithm interface is in the spirit of the C standard library search and sort functions. Compatibility ISO C99, ISO C++98, ISO C++11. Performance These are designed to be general purpose, and reasonably efficient in most circumstances. Notes The biggest problem with these is type safety due to the use of pointer to void for type abstraction. ... -
12
HRSS
Hybrid Relative Specificity Similarity based on Gene Ontology
This software provides a hybrid GO-based semantic similarity algorithm for evaluating the functional similarity between GO terms or gene products. The software uses the pre-downloaded GO database files and the GO annotation files. It allows the users to set organisms, and evidence codes ignored. The software is composed of five modules, getGODAG, getGOAnno, hrssmatrix, hrsstps and hrsspps. -
13
ProximityForest
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer Vision and Pattern Recognition, 2012. This source code is provided without warranty and is available under the GPL license. ... -
14
Bin Packing with Genectic Algorithm
Bin Packing problem solved using Genectic Algorithm
This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007. -
15
Rating Algorithms
Library implementating various rating, scoring, ranking algorithms.
...One example is the ranking of votes based on a 5 star scale. This project started as a need of ordering data based on the relevance of each record obtained from users. The first algorithm implemented is based on Wilson Score Interval. -
16
HIPAcc
Heterogeneous Image Processing Acceleration (HIPACC) Framework
...HIPAcc allows programmers to develop imaging applications while providing high productivity, flexibility and portability as well as competitive performance: the same algorithm description serves as basis for targeting different GPU accelerators and low-level languages. -
17
bioluminescence
A java library for polymorphic genome assembly.
Bioluminescence is a java library for facilitating de novo genome assembly in the context of reads sampled from a single highly-polymorphic diploid individual. Bioluminescence implements a novel algorithm which uses an artificial neural network to classify contigs in a genome assembly as haplotype-specific or not-haplotype-specific. It then uses this information to partition the original input read set into two subsets, each of which has been enriched for one of the haplotypes. Initial results using this technique have dramatically improved de novo asseblies of such data. ... -
18
Simple Playing - Game Framework : An easy to use framework with dependency injection. Based on OpenGL SFML and the boost libraries. Written in C++ and theoretically supporting all major operating systems.
-
19
AlgART Java Libraries
Open source library for processing arrays and matrices
AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over... -
20
Javascript Moony Parser
library: parsing text by given grammar in javascript
This is a javascript library for parsing texts. The library accepts minimalistic moony grammar language and parses given text by the grammar. It is an implementation of "Earley" parser which makes it context free grammar complete. Instructions are bundled in download. -
21
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
22
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
23
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
-
24
Open Uniper
Open Uniper is the XTRAP's reversed encryption algorithm.
Open Uniper is a project created by d3v1l401 (http://d3vsite.org) and targets to make the encryption algorithm of XTRAP open source. Currently NOT Optimized view of code,NOT Optimized code. -
25
Prime-Number-Finder
Prime Number Finder usign Sieve of Eratosthenes
Program by: Ravi Sharma (rvisharma) Prime-Number-Finder-using-Sieve-of-Eratosthenes =============================================== Finds Prime Numbers using Sieve of Eratosthenes Algorithm This Program gives you the prime number upto N Integers, Sieve of Eratosthenes Algorithm is used to determine the Prime Number To find the Prime Number, in the console Shell call the prime_finder(N) function, prime number will be given upto N integer. At first you will be prompted with an input, after that you can call it using function prime_finder(n) example call: >>>prime_finder(10) #output [2,3,5,7] (Int) -> (list)
