Search Results for "stable-diffusion-webui-forge" - Page 5
Sort By:
Showing 143 open source projects for "stable-diffusion-webui-forge"
View related business solutions-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
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
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. -
2
jFAN2 project develops a Java API to use a neural network (neuro-fuzzy) called FAN (Free Associative Neurons). Its an reprogramed version of jFAN "https://sourceforge.net/projects/jfan/".
-
3
Open Pandora's Box
Pandora is an artificial intelligent web based bot
Pandora is an artificial intelligent web based bot written in Java. Pandora is a component based AI architecture including, database memory, XML, voice, voice rec, chat, IRC, HTTP, Wiktionary, Freebase, consciousness, language, GUI, applet, web, jsp, Android -
4
Neuroimitator project.
-
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.
-
5
SMILE = Speech & Music Interpretation by Large Space Extraction openSMILE is a fast, real-time (audio) feature extraction utility for automatic speech, music and paralinguistic recognition research developed originally at TUM in the scope of the EU-project SEMAINE, now maintained and supported by audEERING.
-
6
pySTEP or Python Strongly Typed gEnetic Programming: A light Genetic Programming API that allows the user to easily evolve populations of trees with precise grammatical and structural constraints.
-
7
TreeLiker
TreeLiker is a collection of fast algorithms for working with complex
TreeLiker is a collection of fast algorithms for working with complex structured data in relational form. The data can, for example, describe large organic molecules such as proteins or groups of individuals such as social networks or predator-prey networks etc. The algorithms included in TreeLiker are unique in that, in principle, they are able to search given sets of relational patterns exhaustively, thus guaranteeing that if some good pattern capturing an important feature of the problem... -
8
EpochX is an open source genetic programming framework, specifically for analysing the properties of evolutionary automatic programming. It supports 3 popular representations - Strongly-Typed GP, Context-Free Grammar GP and Grammatical Evolution.
-
9
P53 Cancer Rescue Project, University of California, Irvine , Samuel A. Danziger, Christopher Wassman, Faezeh Salehi Amiri, Roberta Baronio, Linda Hall, Rainer K. Brachmann, G. Wesley Hatfield, Peter Kaiser, Richard H. Lathrop
-
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
10
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... -
11
WAP RSSI 2 ARFF
This program scans WAP RSSI readings and turns then into an ARFF file.
This program runs on a laptop with a wireless card. It scan for wireless access points (WAPs) and notes their Base Station ID or BSSID and their Received Signal Strength Indicator or RSSI. This data, along with an identifier for the physical location or 'ROOM', and the name of the computer it is being run on are stored as an ARFF file, which is compatible with programs such as WEKA and RAPIDMINER. -
12
mlpy
Machine Learning Python
mlpy is a Python module for Machine Learning built on top of NumPy/SciPy and of GSL. mlpy provides high-level functions and classes allowing, with few lines of code, the design of rich workflows for classification, regression, clustering and feature selection. mlpy is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License version 3. mlpy is available both for Python >=2.6 and Python 3.X. -
13
This project contains weka packages of neural networks algorithms implementations like Learning Vector Quantizer (LVQ) and Self-organizing Maps (SOM). For more information about weka, please visit http://www.cs.waikato.ac.nz/~ml/weka/
-
14
HSSVM(Hyper-Sphere Support Vector Machines) is a software for solving multi-classification problem, implemented by Java.
-
15
R-Portfolio - breakeven optimally diversified investment portfolio. Оптимально диверсифицированный инвестиционный портфель.
-
16
SVM# is a svm(support vector machine) classification implemented in C#. The project contains both train and predict modules.
-
17
RoboBeans is an interface to the "Robocup 2D Soccer Simulation Server" that allows developers to write Robocup teams\agents concentrating on behaviour and AI without having to worry about syntax of communication or network issues.
-
18
Feating constructs a classification ensemble comprising a set of local models. It is effective at reducing the error of both stable and unstable learners, including SVM. For details see the paper at http://dx.doi.org/10.1007/s10994-010-5224-5.
-
19
An information extraction library implementing modern algorithms for the extraction of named entities from text.
-
20
The aim of ALIVE is to develop new approaches to the engineering of flexible, adaptable distributed service-oriented systems based on the adaptation of social coordination and organisation mechanisms.
-
21
-
22
The TreeRank project is a R package implementing a Machine Learning algorithm to build tree-based ranking rules from data with binary labels, based on ROC optimization.
-
23
The data complexity library, DCoL, is a machine learning software that implements all metrics to characterize the apparent complexity of classification problems. The code is implemented in C++ and can be run on multiple platforms.
-
24
Content Addressable Memory, Multi-Variate Statistics, Data Mining Includes analyzing datasets, extracting patterns, creating empirical expert system. Computes joint probabilities and implements a "belief" as the solution of an equilibrium equation
-
25
An adaptive neural network and evolutionary algorithms approach to the machine learning tasks, based on the modular graph grammars. Tested on the "two spirals problem" and other tasks. Implemented in Matlab and C++.
