Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.
Build generative AI apps with Vertex AI. Switch between models without switching platforms.
Start Free
MongoDB Atlas runs apps anywhere
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB 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.
Conrad is both a high performance Conditional Random Field engine which can be applied to a variety of machine learning problems and a specific set of models for gene prediction using semi-Markov CRFs.
Extract a Term Concept Map from Wikipedia. It takes an export of the Wikipedia and imports it into a database. The extracted term concept map can then serve as a basis for semantically enhancing applications, with the depth and bredth of the Wikipedia.
FORce based Cluster Editing (FORCE) is a Java software heuristically solving the graph cluster editing problem on weighted edges using BLAST E-values. It further provides a training mode for heuristic parameter estimation.
The simpliZia-program implements the simplex-algorithm and is designed to help students of Operations Research to understand and learn the algorithm. This is a german project, source and program are actually written in german.
K-automaton is a new parsing (syntactic analysis) machine isomorphous to language. Implemented in Java. Can generate Java code from grammars described in EBNF.
General purpose state observation library for Plan Old Java Objects. It enforces Model-View-Controller paradigm, has well defined API and set of ready made implementation algorithms.
LiMa means Lightweight Markup Language. It is a parser for an easy to use ASCII/Text-based markup - comparable to Markdown or the Wikipedia-Markup language with special configurable extensions in defining Links and image-resources.
Java objects that share parts of immutable graphs. Reused subgraphs have directly or indirectly recursive Elements. Selected components get replaced by new counterparts in Context of Mirrors - translation tables. Deep copies are not involved.
Sounder is a spell checker that allows user to enter a word as they think it should sound not as they think it is spelled. A list of similar sounding words is returned to the user with the correct spelling.
JClassCollections is a library of Java collections whose contents can be filtered by class. When a filtered view is requested, all objects that are instances of the specified class (either directly or via inheritance) are included.
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). Work provided by UK Sheffield University funded by (AKT) an IRC sponsored by EPSRC, grant number GR/N15764/01.
JFEP is a Java fast mathematical expression parser and evaluator. It is designed to avoid inefficiency and to support multiple evaluations without overhead.
The project models a Matrix in JAVA with a complete Object Oriented approach, from its values to its access and indices. There are specialized classes for tables(2), cubes(3), and arbitrary(N) dimensions matrices
The Catalsyt Framework is a refinement on the MVC framework. It provides greater focus on user business workflow rather than application workflow. It's goal is to enable business analysis and developers to work closer.
KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.
Project Tokaf is an general implementation of top-k algorithm. It provides interfaces for all modules that are needed. It also features user preferences module, for computing new preferences and manipulating existing ones.
NESD-Imaging is a 2D rendering framework for Java. It combines JAI and Java2D and extends them by providing lazy rendering (do not block UI). It provides geo-positionned images rendering (à la google-map). It scales well to large image set (>500GB).
The main goal of OWLVE is to visualize graphically any OWL–lite file. Using powerful RCP and GEF technologies will improve the quality of graphics and diagrams.This project includes an algorithm for similarity calculus between two OWL files.