Search Results for "algorithm" - Page 5
Sort By:
Showing 131 open source projects for "algorithm"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
ArabicDiacritizer
An automatic restoration of Arabic diacritic marks
This is a software of Arabic diacritical marks restoration. It is based mainly on deep architectures using deep neural network. The algorithm generates diacritized text with determined end case. The algorithm is described in detail in: Ilyes Rebai, and Yassine BenAyed 'Text-to-speech synthesis system with Arabic diacritic recognition system', Computer Speech & Language, 2015. We appreciate it very much if you can cite our related work. ************** Installation *************** - Extract the archive "ArabicDiacritizer Setup.rar"... -
2
LWPR
Locally Weighted Projection Regression (LWPR)
Locally Weighted Projection Regression (LWPR) is a fully incremental, online algorithm for non-linear function approximation in high dimensional spaces, capable of handling redundant and irrelevant input dimensions. At its core, it uses locally linear models, spanned by a small number of univariate regressions in selected directions in input space. A locally weighted variant of Partial Least Squares (PLS) is employed for doing the dimensionality reduction. -
3
A2y
Automated Algorithm Synthesis
-
4
EducationalLCS
eLCS - Educational Learning Classifier System
Educational Learning Classifier System (eLCS) is a set of learning classifier system (LCS) educational demos designed to introduce students or researchers to the basics of a modern Michigan-style LCS algorithm. This eLCS package includes 5 different implementations of a basic LCS algorithm, as part of a 6 stage set of demos that will be paired with the first introductory LCS textbook. Each eLCS implementations (from demo 2 up to demo 6) progressively add major components of the entire LCS algorithm in order to illustrate how work, how they are coded, and what impact they have on how an LCS algorithm runs. ... -
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
5
StabLe
An algorithm for learning stable graphical models from data
Stable Graphical Model Learning (StabLe) is an algorithm for learning the structure and parameters of stable graphical (SG) models from data. Stable random variables are motivated by the central limit theorem for densities with (potentially) unbounded variance and can be thought of as natural generalizations of the Gaussian distribution to skewed and heavy-tailed phenomenon. SG models are multi-variate stable distributions that represent Bayesian networks whose edges encode linear dependencies amongst random variables. ... -
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 and Pattern Recognition, 2012. This source code is provided without warranty and is available under the GPL license. ... -
7
Featurama is a library that implements various sequence-labeling algorithms. Currently Michael Collins' averaged perceptron algorithm is fully implemented.
-
8
TexLexAn is an open source text analyser for Linux, able to estimate the readability and reading time, to classify and summarize texts. It has some learning abilities and accepts html, doc, pdf, ppt, odt and txt documents. Written in C and Python.
-
9
Java application for training and deploying text processing applications such as part-of-speech taggers, based on a re-implementation of Brill's algorithm in Java.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
10
cCNN
A fast implementation of LeCun's convolutional neural network
Code of this library is partialy based on myCNN MATLAB class written by Nikolay Chemurin. -
11
Reactor Breeder
A Genetic Algorithm for Reactors in StarMade
This software uses a genetic algorithm to "evolve" reactor designs for Schema's space-simulation game, Star-Made (http://star-made.org/). One of the more unique aspects of the game is that ship power management is not as simple as filling a cube with power generation blocks. This mechanism leads to difficulties in getting maximal power generation out of such reactors. -
12
NeuralGas
Self-organized learning
A collection of algorithms based on the topology preserving Neural Gas algorithm for density estimation/quantization/clustering/self-organized learning. I moved this project to GitHub: https://github.com/sergioroa/neuralgas -
13
Clever Algorithms
Clever Algorithms: Nature-Inspired Programming Recipes
...Example implementations and worked problems show how to encode solutions, define fitness, and balance exploration with exploitation. The emphasis is on pragmatism—enough theory to understand why an algorithm works, and enough detail to get it running in your environment. It’s a useful starting point for students and practitioners who want to prototype, benchmark, or hybridize algorithms without digging through scattered academic papers. -
14
CvHMM
Discrete Hidden Markov Models based on OpenCV
This project (CvHMM) is an implementation of discrete Hidden Markov Models (HMM) based on OpenCV. It is simple to understand and simple to use. The Zip file contains one header for the implementation and one main.cpp file for a demonstration of how it works. Hope it becomes useful for your projects. -
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 encoding, optimizing memory usage and so on. ... -
16
Stanford Machine Learning Course
machine learning course programming exercise
...The repository covers a broad set of topics such as linear regression, logistic regression, neural networks, clustering, support vector machines, and recommender systems. Each folder corresponds to a specific algorithm or concept, making it easy for learners to navigate and practice. The exercises serve as practical, hands-on reinforcement of theoretical concepts taught in the course. This collection is valuable for students and practitioners who want to strengthen their skills in machine learning through coding exercises. -
17
This is a variant of k-means algorithm which allows datas to belong to several clusters instead of just one.
-
18
Leark is a Data Mining library developed in C#.NET. It contains several methods for ranking web documents described with a set of normalized features, and a feature selection algorithm. The methods are based on perceptron and clustering.
-
19
BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.
-
20
Optex Analyzer is a software to analyze and compare algorithms to solve approximately optimization problems. It has a GUI that allows select a set of input files containing raw algorithm results. The analysis is shown with tables and charts.
-
21
weka outlier is an implementation of outlier detection algorithms for WEKA. CODB (Class Outliers: Distance-Based) Algorithm is the first algorithm developed using WEKA framework.
-
22
Maui is a multi-purpose automatic topic indexing algorithm. Given a document, Maui automatically identifies its topics. Depending on the task topics are tags, keywords, keyphrases, vocabulary terms, descriptors or Wikipedia titles.
-
23
This project has been renamed to oooark. Old file releases will still be available here. uvsim is a project focused on enabling algorithm development for unmanned systems. It is being constructed to provide an identical interface to simulations and h
-
24
Very basic cellular automaton implementation in C#. Based upon the "Togetherness" algorithm described at http://www.hermetic.ch/pca/tg.htm.
-
25
This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library supports the 26 genetic operators. This is cross-platform GA written in С++.