Open Source Algorithms - Page 26
Sort By:
Algorithms
View 5679 business solutions-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
Build Securely on Azure 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
Use, study and develop advanced digital halftoning algorithms with Halftone Laboratory, a GIMP plug-in backed by a highly modular and extensible library. It uses .NET/Mono and GIMP#.
-
2
Happy Cube Solver
Solves the given cubes puzzles and prints the solution
Solves the given cubes puzzles and prints the solution 1. You may download code: git clone git://git.code.sf.net/p/happycubesolver/code happycubesolver-code 2. Build: mvn clean install assembly:assembly -DskipTests -Dmaven.test.skip=true -DdownloadSources=true -Dcheckstyle.skip=true 3. Run: java -jar target/cubes-1.0-fat.jar -
3
Harmony
Roommate Pairing
Program for Residence Life staffs to aid in roommate pairing. -
4
.NET, (in future - VB DLL, C# DLL and Pascal .TPU) class library realizing associative arrays mechanism for VB.NET (an other languages).
-
Test your software product anywhere in the worldGlobal App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
-
5
HeaDDaCHe
Hashed dynamic determinants for convex hulls
Description: We propose and implement in C++ the hashed dynamic determinants scheme. This consists of efficient implementations of dynamic determinant algorithms and a hash table that stores intermediate results (matrices and determinants) in order to be used in subsequent steps of the algorithm. Related papers: V.Fisikopoulos, L.Peñaranda. Faster Geometric Algorithms via Dynamic Determinant Computation. In Algorithms – ESA 2012, Lecture Notes in Computer Science Volume 7501, 2012, pp 443-454. -
6
Open Source IM and voice client using Jabber and SIP protocols, with great audio quality thanks to speex and a nice and clean interface. Programmed in Java and C++. It supports chat, voice and file transfers.
-
7
-
8
HeuriStitch
An heuristic image stitcher
An heuristic image stitcher made to test Genetic and PSO based algorithms -
9
Multidimensional scaling (MDS) is a powerful dimension reduction technique for embedding high-dimensional data into a low-dimensional target space.
-
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. Click to perfect your product now.
-
10
This project aims to develop a colour-based vision processing system for use in RoboCup. We are using a CCD camera for input to an FPGA. The system locates coloured objects and outputs detected corners.
-
11
High-order HMM in Matlab
Implementation of duration high-order hidden Markov model in Matlab.
Implementation of duration high-order hidden Markov model (DHO-HMM) in Matlab with application in speech recognition. -
12
Hipo is a hypothetical computer to facilitate the learning of machine language. The student can use hipo to develop simple programs and understand the internal logic of a computer. There is a plan to implement Donald Knuth's MMIX machine language, also.
-
13
A histogram library for Java that accepts large datasets with any distribution or range with a very small memory footprint, needs no pre- or post-processing, and provides several statistical functions.
-
14
HitCrypt
Descritografar e Criptografar XMLs do Tribunal de Justiça
O HitCrypt é uma ferramenta que pode ser utilizada para Decryptar o arquivo de Selos e Encryptar. Inicialmente este aplicativo está preparado para funcionar para o tribunal de justiça do estado de Minas Gerais. -
15
Das Horner-Schema ist ein schnelles und einfaches Verfahren, um einen Funktionswert von Polynomen an einem gegeben Wert zu berechnen. Dieses Projekt beinhält eine Facharbeit und Programmierbeispiele in Pascal und Java zum Thema.
-
16
This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.
-
17
Human mouse
Human-like mouse movements
Library provides a function of 'human-like mouse movements', ie mouse movements as human. The library will be useful for those who are developing all kinds of bots for games or online casino \ poker. Written in C + +, has a small size of 13 kilobytes. -
18
Hyacc is an efficient and practical Yacc/Bison-compatible full LR(1)/LALR(1)/LR(0) and partial LR(k) parser generator in ANSI C based on Knuth and Pager's LR(1) algorithms. Generated parser can be used in open-source or commercial software.
-
19
This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.
-
20
This project provides some hyperheuristics, implemented as C libraries. A hyperheuristic can be used to handle any optimization problem, as long as you implement some simple specific code to interact with it. Some examples/applications are also provided.
-
21
-
22
I is a cross-platform programming language designed towards efficiency during development and at runtime.
-
23
Passwords generator for IAD devices, using 3 keys and a index. The result is a fixed lenght of alphabetic characters. The algorithm works with other 3 big fixed prime numbers. These 3 numbers define a family of passwords. Finally, it provides a guaranteed functional string to use in all variety of devices without rejects.
-
24
IDA (Java)
Java implementation of the IDA
Information Dispersal Algorithym (IDA) is a method to split a file f into n pieces in such a way that the file can be reconstructed from some predefined subsets of pieces. this is a Java implementation. -
25
The IEEE 1619 Committee open-source reference implementations of encryption algorithms, plus testing and certification suites, for each encryption algorithm included in the standard.
