Search Results for "structure" - Page 13
Sort By:
Showing 355 open source projects for "structure"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Stop vibe-debugging.AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
-
1
Deep Reinforcement Learning TensorFlow
TensorFlow implementation of Deep Reinforcement Learning papers
Deep Reinforcement Learning TensorFlow is a comprehensive TensorFlow codebase that implements several foundational deep reinforcement learning algorithms for educational and experimental use. The repository focuses on clarity and modularity so users can study how different RL approaches are built and compare their behavior across environments. It includes implementations of well-known algorithms such as Deep Q-Networks (DQN), policy gradients, and related variants, demonstrating how neural... -
2
FastPhotoStyle
Style transfer, deep learning, feature transform
FastPhotoStyle is a deep learning-based image stylization framework designed to transfer the style of one photograph onto another while preserving photorealistic quality. Unlike traditional artistic style transfer methods that produce painterly outputs, this approach focuses on maintaining realistic textures, lighting, and spatial consistency. The method is based on a two-step process that includes a stylization phase followed by a smoothing operation, ensuring that the output image remains... -
3
vue-tetris
Use Vue, Vuex to code Tetris
...The design emphasizes performance and responsiveness, ensuring smooth gameplay even within a web environment. It also serves as an educational resource for developers learning Vue.js, illustrating how to structure real-time applications. The project may include additional features such as keyboard controls, game speed adjustments, and visual styling. Overall, vue-tetris combines entertainment with practical frontend development techniques. -
4
faif
C++ header only library with AI and bioinformatics algorithms
C++ header only library, small and fast; Naive Bayesian Classifier, Decision Tree Classifier (ID3), DNA/RNA nucleotide second structure predictor, timeseries management, timeseries prediction, generic Evolutionary Algorithm, generic Hill Climbing algorithm and others. -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
5
...Universal language support (depending on the availability of training data), with language-specific features for Chinese and English. Currently support word segmentation, POS tagging, dependency and phrase-structure parsing.
-
6
GT NLP Class
Course materials for Georgia Tech CS 4650 and 7650
This repository contains lecture notes, slides, assignments, and code for a university-level Natural Language Processing course. It spans core NLP topics such as language modeling, sequence tagging, parsing, semantics, and discourse, alongside modern machine learning methods used to solve them. Students work through programming exercises and problem sets that build intuition for both classical algorithms (like HMMs and CRFs) and neural approaches (like word embeddings and sequence models).... -
7
JCLTP
A Java Class Library for Text Processing
...It incorporates several technologies that enable process information while applying AI techniques, in order to build predictive models for text classification. Through a flexible structure of interfaces and classes, the opportunity to extend, adapt and add functionality JCLTP is provided. Thus, analysis of new types of information is much easier and intuitive. The researcher can use the class library by adding it to his project or direct through specific commands created for these cases. The results obtained in applying AI algorithms are stored in files for later analysis. -
8
WebDjVuTextEd
Edit the OCR text layer of DjVu documents in a web browser
WebDjVuTextEd allows to edit the text layer of OCR'ed DjVu documents in a web browser. You can modify the structure (paragraphs, lines, words...) create, delete, edit text nodes, modify their container box by mouse, and run a spellchecker. The program does not directly read the DjVu files, it requires exported XML text data and images. When using without a webserver, you can open and save local files, but cannot take advantages of auto-save and spell checking. -
9
HLearn
Homomorphic machine learning
HLearn is a Haskell-based machine learning library focused on composability, algebraic structure, and performance. It provides a functional approach to building machine learning algorithms by leveraging algebraic properties such as monoids and groups. This allows for parallel, incremental, and distributed computation in a mathematically consistent way. HLearn aims to provide implementations of common algorithms like k-means, naive Bayes, and others while maintaining the expressiveness and safety of the Haskell language. -
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
10
JAABA
The Janelia Automated Animal Behavior Annotator
The Janelia Automatic Animal Behavior Annotator (JAABA) is a machine learning-based system that enables researchers to automatically compute interpretable, quantitative statistics describing video of behaving animals. Through our system, users encode their intuition about the structure of behavior by labeling the behavior of the animal, e.g. walking, grooming, or following, in a small set of video frames. JAABA uses machine learning techniques to convert these manual labels into behavior detectors that can then be used to automatically classify the behaviors of animals in large data sets with high throughput. ... -
11
Java OCR is a suite of pure java libraries for image processing and character recognition. Small memory footprint and lack of external dependencies makes it suitable for android development. Provides modular structure for easier deployment
-
12
eANN
eANN is an implementation of several kind of neural networks.
...It is possible to have several different sized networks running simultaneously, each functioning independently of the others or acting as inputs between them. It also easy to modify the structure so that neurons (or even whole layers) can be created/pruned during simulation allowing dynamic expansion/contraction of the network. -
13
OpenSchema
Document Structuring schema for Natural Language Generation
An Open Source Java implementation of Document Structuring schema (pl. schemata). Schemata structure (order) a set of facts (RDF in this case). They decide what to say in a Natural Language Generation (NLG) system. Introduced by McKeown (1985). -
14
S-Match
S-Match is a semantic matching framework.
...S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration, ontology evolution and alignment, peer-to-peer information sharing, digital libraries integration, web service composition, agent communication, and query answering on the web. S-Match is extendable to host new algorithms. -
15
Chordalysis
Log-linear analysis (data modelling) for high-dimensional data
...Chordalysis exploits recent discoveries in graph theory by representing complex models as compositions of triangular structures, also known as chordal graphs. Chordalysis makes it possible to discover the structure of datasets with thousands of variables on a standard desktop computer. Associated papers at ICDM 2013, ICDM 2014 and SDM 2015 can be found at http://www.francois-petitjean.com/Research/ YourKit is supporting Chordalysis open source project with its full-featured Java Profiler. YourKit is the creator of innovative and intelligent tools for profiling Java and .NET applications. http://www.yourkit.com -
16
Java class libraries for structural biology development: includes protein format conversion tool, printf-based text formatting, Pred2ary secondary structure prediction, neural net library, Hooke-Jeeves global optimizer, and misc. math & statistics.
-
17
OpenNLP provides the organizational structure for coordinating several different projects which approach some aspect of Natural Language Processing. OpenNLP also defines a set of Java interfaces and implements some basic infrastructure for NLP compon
-
18
cosd_java
A Tool for Searching and Demonstrating Code Structure
CoSD is a tool for searching and demonstrating code structure based on graph database. Since some commercial code is involved in the industrial version of CoSD , we just give out a baseline version of it. We also provide a quick demo for this baseline version. To use CoSD, please read the file readme.txt at first. -
19
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. ... -
20
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. -
21
drvq
dimensionality-recursive vector quantization
...It is an approximation of k-means that is practically constant in data size and applies to arbitrarily high dimensions but can only scale to a few thousands of centroids. As a by-product of training, a tree structure performs either exact or approximate quantization on trained centroids, the latter being not very precise but extremely fast. A detailed README file describes the usage of the software, including license, requirements, installation, file formats, sample data, tools, and options. With the sample data provided and the default options, it is possible to test the code immediately as a demo. ... -
22
Unsupervised TXT classifier
Classify any two TXT documents, no training required - JAVA
...The summarizer from Classifier4J has been adjusted to accept two inputs (lets call them A and B). Then, the summarizer gets trained with A to summarize a document B, and vice versa. This extracts a relevant structure for both documents (and thus avoids the over-training) which are then compared using the Vector-Space analysis to give a range of belonging of one document to another (and thus avoids the shortage of information). This method can be used to create the user-defined classes by merging texts of certain categories and then to calculate the relevant distances between the documents, but this is not necessary. -
23
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. -
24
MSTParser
MSTParser is a non-projective dependency parser that searches for maxi
MSTParser is a non-projective dependency parser that searches for maximum spanning trees over directed graphs. Models of dependency structure are based on large-margin discriminative training methods. Projective parsing is also supported. mstparser 0.5.1 is now available via Maven Central. If you use Maven as your build tool, then you can add it as a dependency in your pom.xml file: <dependency> <groupId>net.sourceforge.mstparser</groupId> <artifactId>mstparser</artifactId> <version>0.5.1</version> </dependency> -
25
NOTE: This project was moved to: https://github.com/eetorres The BPANNA is a flexible Back propagation neural network, which include the Conjugate Gradient and the Levenberg-Marquardt. You can change the number of inputs, number of layers, number of neurons per layer and outputs. It included an structure editor.
