Search Results for "algorithm" - Page 2
Sort By:
Showing 81 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
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 -
2
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... -
3
Levenshtein distance Java Libarary
Java library implementing Levensh distnce
-
4
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
-
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.
-
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
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...
-
7
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! -
8
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... -
9
textcrypter
textcrypter is an encryption tool using vigenere cipher algorithm
Textcrypter is an encryption tool using vigenere cipher algorithm. Vigenere use the same key/password to encrypt and decrypt a file (symmetric key cryptosystem). Result of the encryption process is a ciphertext in hexa number. -
MongoDB Atlas | Run databases anywhereMongoDB Atlas allows you to build and run modern applications across 125+ cloud regions, spanning AWS, Azure, and Google Cloud. Its multi-cloud clusters enable seamless data distribution and automated failover between cloud providers, ensuring high availability and flexibility without added complexity.
-
10
Java Random Numbers - Random.Org API
Offers Random numbers API for your programs written in Java.
Very lightweight and easy to use library that allows you to generate truly random numbers by means of Random.Org service. Library offers optimized algorithms for obtaining single random number or more random numbers at once, sequences of numbers, random strings etc. Also allows you to check quota. It provides algorithm to generate unspecified number of random numbers of certain total value. This algorithm still keeps server load low by sending as large requests as possible, yet all... -
11
Genetic Basis
A general genetic algorithm framework
-
12
BayesianCortex
simple algorithm for a realtime interactive visual cortex for painting
A paint program where the canvas is the visual cortex of a simple kind of artificial intelligence. You paint with the mouse into its dreams and it responds by changing what you painted gradually. There will also be an API for using it with other programs as a general high-dimensional space. Each pixel's brightness is its own dimension. Bayesian nodes have exactly 3 childs because that is all thats needed to do NAND in a fuzzy way as Bayes' Rule which is NAND at certain extremes. NAND can be... -
13
SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.
-
14
EGA
A novel and effictive GA algorithm to solve optimization problem
Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments... -
15
MbPc Pagerank Simulator
Testbed for playing with the algorithm "pagerank" of Google
Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added. -
16
GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.
-
17
ProViz is a program visualization framework for Java. It is built as a plugin to the Eclipse IDE. (We are getting close to publishing resources and making this project distributable. Stay tuned!) A video demo: http://www.youtube.com/watch?v=BsoK1n-OM
-
18
X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.
-
19
A java project to create a library that can calculate decompression schemes for diving. Different open source algorithms can be chosen to use for the calculation. For example Bühlmann and VPM.
-
20
Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.
-
21
Beagle is Java open source framework for running and managing nondeterministic algorithms such as genetic algorithms for solving complex problems. Beagle is fully modular and maintains whole history of algorithm progress for further analysis.
-
22
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.
-
23
-
24
a first work algorithm trials to implement a compromise between distributed and centralized version control system.part of research project,it's only a simulation. no real networking is implemented ,only virtual random signal are imaginary produced.
-
25
A Java package for pretty-printing a text by deciding where to introduce line-breaks and indentation. A Java implementation of Derek Oppen\'s pretty printing algorithm. It is _not_ a pretty printer for Java code, though it could be used to write one.
