Search Results for "algorithm" - Page 5
Sort By:
Showing 262 open source projects for "algorithm"
View related business solutions-
Your top-rated shield against malware and online scams | Avast Free AntivirusOur antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
-
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
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. 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... -
2
-
3
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... -
4
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. 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. -
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
5
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 -
6
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... -
7
Rating Algorithms
Library implementating various rating, scoring, ranking algorithms.
The rating algorithms library contains various algorithms used to accurately rank, score or rate collections of similar data. 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. -
8
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... -
9
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
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.
-
10
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
11
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
-
12
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. -
13
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... -
14
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... -
15
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. -
16
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... -
17
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... -
18
Sharp Statistics
A simple program for comparing data sets with simple algorithms.
Replace the data in the data.db file with your own data using an sqlite3 manager. Tables are read as data set names, and the values are read as the data points of the data sets. Load the application, choose an algorithm, and the program will find the pairs that best match each other. -
19
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. -
20
tawSolver
An efficient implementation of the DPLL Algorithm
This is Version 1.0. A later version is available on https://github.com/OKullmann/oklibrary/blob/master/Satisfiability/Solvers/TawSolver/tawSolver.cpp -
21
The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.
-
22
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity...
-
23
Mouse Run
Programming Game, A Practice Tool for Building Intelligent Things
.../(or whatever you like to call yourself) like us. This game will be a perfect practice tool for programmers like us to find the best algorithm solutions and make the mouse intelligent. To get information on this game, visit the Mouse Run website at http://mouse-run.appspot.com If you have found bugs or have a request, please do write it in the reviews. Thanks! -
24
Exact Subgraph Matching Algorithm
Exact Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue... -
25
ACADO Toolkit
Toolkit for Automatic Control and Dynamic Optimization
ACADO Toolkit is a software environment and algorithm collection for automatic control and dynamic optimization. It provides a general framework for using a great variety of algorithms for direct optimal control, including model predictive control, state and parameter estimation and robust optimization. ACADO Toolkit is implemented as self-contained C++ code and comes along with user-friendly MATLAB interface. The object-oriented design allows for convenient coupling of existing optimization...
