Search Results for "automatic1111-stable-diffusion" - Page 3
Sort By:
Showing 96 open source projects for "automatic1111-stable-diffusion"
View related business solutions-
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.
-
Auth0 B2B Essentials: SSO, MFA, and RBAC Built InAuth0's B2B Essentials plan gives you everything you need to ship secure multi-tenant apps. Unlimited orgs, enterprise SSO, RBAC, audit log streaming, and higher auth and API limits included. Add on M2M tokens, enterprise MFA, or additional SSO connections as you scale.
-
1
BagaturChess
Java Chess Engine
This is UCI Chess Engine writen in Java. Since version 1.4 (inclusive) the project was moved to https://github.com/bagaturchess/Bagatur -
2
jPrediction
Open project ternary classifier of the machine learning
Open project ternary classifier of the machine learning -
3
JCLAL
A Java Class Library for Active Learning
JCLAL is a general purpose framework developed in Java for the active learning research area. JCLAL framework is open source software and it is distributed under the GNU general public license. It is constructed with a high-level software environment, with a strong object oriented design and use of design patterns, which allow to the developers reuse, modify and extend the framework. If you want to refer to JCLAL in a publication, please cite the following JMLR paper. The full citation... -
4
-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
5
GA-EoC
GeneticAlgorithm-based search for Heterogeneous Ensemble Combinations
In data classification, there are no particular classifiers that perform consistently in every case. This is even worst in case of both the high dimensional and class-imbalanced datasets. To overcome the limitations of class-imbalanced data, we split the dataset using a random sub-sampling to balance them. Then, we apply the (alpha,beta)-k feature set method to select a better subset of features and combine their outputs to get a consolidated feature set for classifier training. To... -
6
libcrn is document image processing library written in C++11 for Linux, Windows, Mac OsX and Google Android. It is a toolbox that allows to create easily software such as OCRs and layout analysis tools.
-
7
TrackMania Challenge Generator
Challenge generator for racing game 'TrackMania Nations Forever'
A small tool which generates infinite number of different challenges for racing game 'TrackMania Nations Forever'. Currently only "Stadium" environment is supported. Latest release: 1.0.1.0, both English and Chinese version available. -
8
Adaptive Difficulty Chinese Chess
A Chinese chess game including an adaptive computer opponent.
This project is an application of POSM algorithm on Chinese chess computer player. A computer player is implemented, which will adapt to the its opponent by adjusting its playing strength accordingly. -
9
Machine Learning framework in Python
-
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
10
DE-HEoC
DE-based Weight Optimisation for Heterogeneous Ensemble
We propose the use of Differential Evolution algorithm for the weight adjustment of base classifiers used in weighted voting heterogeneous ensemble of classifier. Average Matthews Correlation Coefficient (MCC) score, calculated over 10-fold cross-validation, has been used as the measure of quality of an ensemble. DE/rand/1/bin algorithm has been utilised to maximize the average MCC score calculated using 10-fold cross-validation on training dataset. The voting weights of base classifiers are... -
11
FPF_predict
Fine Particle Fraction (FPF) predictor
Application implements models described by classical mathematical equation for in vitro deposition prediction based on characteristics of formulation and assay conditions. This work was funded by Poland-Singapore bilateral cooperation project no 2/3/POL-SIN/2012. Published article: https://www.dovepress.com/empirical-modeling-of-the-fine-particle-fraction-fornbspcarrier-based--peer-reviewed-fulltext-article-IJN -
12
JCLALwebservice
Web service for JCLAL
This work is part of the area of Artificial Intelligence, in particular in the field of machine learning. The web service is built to facilitate the use of JCLAL in applications developed in any programming language. Users should know only the basic format to send and receive requests. -
13
JCLALtext
Text processing module for JCLAL
JCLALtext is a class library designed to extend the framework JCLAL text tasks. JCLALtext is free, open source and developed with the Java programming language. JCLALtext is distributed under the GNU license. The researcher can use the class library by adding it to your project. -
14
Accelerated Feature Extraction Tool
A fast GPU accelerated feature extraction software for speech analysis
A fast feature extraction software tool for speech analysis and processing. It incorporates standard MFCC, PLP, and TRAPS features. The tool is a specially designed to process very large audio data sets. It uses GPU acceleration if compatible GPU available (CUDA as weel as OpenCL, NVIDIA, AMD, and Intel GPUs are supported). CPU SSE intrinsic instruction set is used in cases where no compatible GPU present. The output files are stored in HTK format. The software is developed at Department of... -
15
nn22 Basic Neural Networks for Octave
Simple .m files, Basic Neural Networks study for Octave (or Matlab)
--> For a more detailed description check the README text under the 'Files' menu option :) The project consists of a few very simple .m files for a Basic Neural Networks study under Octave (or Matlab). The idea is to provide a context for beginners that will allow to develop neural networks, while at the same time get to see and feel the behavior of a basic neural networks' functioning. The code is completely open to be modified and may suit several scenarios. The code... -
16
Automatic cell lineage reconstruction
Automatic segmentation and tracking for 3D time-lapse microscopy
From Amat et al., Nature Methods, 2014*: "The comprehensive reconstruction of cell lineages in complex multicellular organisms is a central goal of developmental biology. We present an open-source computational framework for segmentation and tracking of cell nuclei with high accuracy and speed. We demonstrate its (1) generality, by reconstructing cell lineages in four-dimensional, terabyte-sized image data of fruit-fly, zebrafish and mouse embryos, acquired with three different types of... -
17
MODLEM
rule-based, WEKA compatible, Machine Learning algorithm
This project is a WEKA (Waikato Environment for Knowledge Analysis) compatible implementation of MODLEM - a Machine Learning algorithm which induces minimum set of rules. These rules can be adopted as a classifier (in terms of ML). It is a sequential covering algorithm, which was invented to cope with numeric data without discretization. Actually the nominal and numeric attributes are treated in the same way: attribute's space is being searched to find the best rule condition during rule... -
18
-
19
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. Please cite: [1] Sethu... -
20
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. -
21
BudgetedSVM
BudgetedSVM: A C++ Toolbox for Large-scale, Non-linear Classification
We present BudgetedSVM, a C++ toolbox containing highly optimized implementations of three recently proposed algorithms for scalable training of Support Vector Machine (SVM) approximators: Adaptive Multi-hyperplane Machines (AMM), Budgeted Stochastic Gradient Descent (BSGD), and Low-rank Linearization SVM (LLSVM). BudgetedSVM trains models with accuracy comparable to LibSVM in time comparable to LibLinear, as it allows solving highly non-linear classi fication problems with millions of... -
22
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/".
-
23
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.
-
24
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.
-
25
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...
