Search Results for "algorithm" - Page 12
Sort By:
744 programs for "algorithm" with 1 filter applied:
-
Turn Your Content into Interactive Magic - For FreeTransform anything you share into an engaging digital experience - for free. Instantly convert your PDFs, slides, and files into dynamic, interactive sessions with built-in collaboration tools, activities, and real-time assessment. From teaching to training to team building, make every presentation unforgettable. Used by millions for education, business, and professional development.
-
Powering the best of the internet | FastlyEnsure your websites, applications and services can effortlessly handle the demands of your users with Fastly. Fastly’s portfolio is designed to be highly performant, personalized and secure while seamlessly scaling to support your growth.
-
1
Trofast Stavekontrol
Trofast is an intelligent spell checker.
Trofast is an intelligent spell checker library based on statistical analysis developed for the Danish language. It makes use of n-grams, hidden Markov models and the Viterbi-algorithm. -
2
This a NetBeans project developed to create a small Hexagon map library with a few basic functionalities. It is possible to measure distance between tiles's centres and calculate the best path between two of them (if any). It is possible to define tiles where it is not possible to pass (or reenabling them) by right clicking on them (they will become red), creating therefore obstacles that can help testing the path finding algorithm. This library is licences under GPL licence.
-
3
Dinapter:
Generate adaptation contracts between incompatible services
Dinapter automatically generates a mapping between methods of incompatible components/services based on their public interfaces and behaviors. It uses a combination of expert system and A* algorithm. Dinapter is the prototype resulting from a couple of research papers: * J.A. Martín, E. Pimentel. Automatic Generation of Adaptation Contracts, FOCLASA'08, ENTCS, 2008 - http://goo.gl/21iJZ * J.A. martín, E. Pimentel. Dinapter: Automatic Adapter Specification for Software Composition... -
4
PyPedal is a Python module that provides tools for the manipulation of pedigrees, simple visualization of pedigrees, and the calculation of measures of genetic diversity from pedigrees.
-
Deliver secure remote access with OpenVPN.OpenVPN's products provide scalable, secure remote access — giving complete freedom to your employees to work outside the office while securely accessing SaaS, the internet, and company resources.
-
5
Spantus - signal(speech) analytical tool
-
6
AllCheckSumer
Calculate and compare files with 3 different file signature algorithms
AllCheckSumer is a handy tool for computer forensics and is helpful for investigators to search throughout a computer’s file system for a bad hash specified by the investigator. The tool will search throughout a location, specified by the investigator. It can be either an entire file system or a specific folder, and create a hash set with the following file signature algorithms: • MD5 (Message-Digest Algorithm v. 5) • SHA-1 (Secure Hash Algorithm v. 1) • CRC (Cyclic Redundancy Check) -
7
NitroCache
Extremely fast, scalable, concurrent, pure Java In-memory cache
One of the fastest, 100% Pure Java In-memory cache. Its aimed at providing very fast, light, highly scalable cache with high concurrency. The fetch operation from cache are always in constant time, O(c), irrespective of the number of threads accessing the cache or cache size. NitroCache uses unique custom algorithm inspired by Btree, skiplist and hashing to deliver a constant time cache with lock-less fetches. For details on using NitroCache, please visit wiki section Note... -
8
Galois sub-hierarchy builder
Visualize Galois sub-hierarchy of 2d matrix
GSH builder is a free Galois Sub-Hierarchy visualization tool. The algorithm for calculating GSH is called Pluton and the present Java realization is based on two articles. "Efficiently computing a linear extension of the sub-hierarchy of a Concept Lattice" by Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret and Jeremy P. Spinrad. "Performances of Galois Sub-hierarchy-building algorithms" by Gabriela Arevalo, Anne Berry, Marianne Huchard, Guillaume Perrot... -
9
SmithWaterman
Fast local sequence alignment for the masses!
MOVED TO GITHUB: https://github.com/noporpoise/seq-align An implementation of the Smith-Waterman local sequence alignment algorithm. See our sister project global alignment using Needleman-Wunsch: http://sourceforge.net/projects/needlemanwunsch/ -
MongoDB 8.0 on Atlas | Run anywhereMongoDB 8.0 brings enhanced performance and flexibility to Atlas—with expanded availability across 125+ regions globally. Build modern apps anywhere your users are, with the power of a modern database behind you.
-
10
Software for making Clusters of Orthologous Groups (featuring the new EdgeSearch algorithm). Latest ref: Kristensen DM, Kannan L, Coleman MK, Wolf YI, Sorokin A, Koonin EV, Mushegian A. Bioinformatics 2010.
-
11
JAVA Arabic Stemmer
A JAVA class with a small functionality that is stemming Arabic words
A JAVA Arabic stemmer that is based on Shereen Khoja algorithm. This java class offers a function called stemWrod which takes an arabic word and return the stem of it. -
12
Genetic Basis
A general genetic algorithm framework
-
13
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... -
14
CRF is a Java implementation of Conditional Random Fields, an algorithm for learning from labeled sequences of examples. It also includes an implementation of Maximum Entropy learning.
-
15
CRFSharp
CRFSharp is a .NET(C#) implementation of Conditional Random Field
CRFSharp(aka CRF#) is a .NET(C#) implementation of Conditional Random Fields, an machine learning algorithm for learning from labeled sequences of examples. It is widely used in Natural Language Process (NLP) tasks, for example: word breaker, postagging, named entity recognized, query chunking and so on. CRF#'s mainly algorithm is the same as CRF++ written by Taku Kudo. It encodes model parameters by L-BFGS. Moreover, it has many significant improvement than CRF++, such as totally parallel... -
16
WiFi Location Tracking
Location tracks objects based on SSID strength in 2D environments
This simple algorithm gives an example of location tracking in indoor environment using WiFi signals strengths sent to a local sever machine which then determines the clients location. -
17
MongoLantern - MongoDB Fulltext Search
Open Source MongoDB Fulltext Search Server
MongoLantern is an open source full text search server using MongoDB as index storage, which allows MongoLantern to migrate any changes very easily into account using MongoDB API. It's written originally written in PHP can be migrated to any desired language as required using it's future APIs. MongoLantern 0.7 - Stable/Production Release: 1. MongoLantern API support enabled. 2. CSV indexer added as a plugin. 3. node.js API client added. -
18
Bracer
Repository has been moved to: http://dtitov.github.com/bracer
Java library for parsing and evaluating math expressions. Javadoc is available at http://bracer.sourceforge.net/javadoc/ P.S. This library depends on Apache Commons Math, so don't forget to include commons-math-2.2.jar to your project. -
19
JCRCGen
Generates Java source code for the CRC algorithm.
JCRCGen is a tool written completely in Java that will output public domain Java source code containing both the simple and table-driven implementations of the Rocksoft Model CRC algorithm. Generator polynomials may be any 8-bit multiple between 8 and 64 bits. -
20
Algorithm::Evolutionary provides classes for performing simple evolutionary computation tasks, including definition of objects from XML and SOAP support. It should be interoperable with other EC libraries using SOAP.
-
21
SINGHAL mutual exclusion in FreeBSD
Design and Implementation of the Singhal token based mutual exclusion
[ Design and Implementation of the Singhal token based mutual exclusion algorithm in kernel-space of FreeBSD ] | Data & Network Security Lab (DNSL) | Room 501, Floor 5, | Department of Computer Engineering | Sharif University of Technology | Azadi Ave., Tehran, Iran Vahid Khodabakhshi <vkhodabakhshi@ce.sharif.edu> Vahid Ranjbar <vranjbar@ce.sharif.edu> Also see the Acknowledgement file Please send bugs to our e-mail -
22
This is a MATLAB implementation of inverse compositional Active Appearance Models (AAMs), as described in the "Active Appearance Models Revisited" paper by Iain Matthews and Simon Baker.
-
23
j-Algo is an algorithm visualization tool, especially useful for students and lecturers of computer science. It is written in Java and platform independent. j-Algo is developed at Dresden University of Technology.
-
24
puff
Fast and Strong Data Encryption Algorithm
svn checkout http://umcipher.googlecode.com/svn/trunk/ umcipher-read-only -
25
This project focuses on implementing flash photography related algorithms. The first algorithm to be implemented is called "Flash Photography Enhancement via Intrinsic Relighting", presented in SIGGRAPH 2004, see http://artis.imag.fr/Publications/2004/
