Search Results for "ofn-layer-aligner"
Sort By:
Showing 7 open source projects for "ofn-layer-aligner"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Automate contact and company data extractionGenerate leads at scale without building or maintaining scrapers. Use 10,000+ ready-made tools that handle authentication, pagination, and anti-bot protection. Pull data from business directories, social profiles, and public sources, then export to your CRM or database via API. Schedule recurring extractions, enrich existing datasets, and integrate with your workflows.
-
1
Universal Java Matrix Package
sparse and dense matrix, linear algebra, visualization, big data
The Universal Java Matrix Package (UJMP) is an open source Java library which provides sparse and dense matrix classes, as well as a large number of calculations for linear algebra such as matrix multiplication or matrix inverse. Operations such as mean, correlation, standard deviation, replacement of missing values or the calculation of mutual information are supported, too. The Universal Java Matrix Package provides various visualization methods, import and export filters for a large... -
2
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of... -
3
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity...
-
4
Black Hole Cortex
Sphere surface layers of visual cortex approach maximum info density
...We can think of Wikipedia as a layer above our brains, a global SphereSurface of large surface area (a cortex layered on billions of minds) and small (10000 most important pages) density. -
Create and run cloud-based virtual machines.Computing infrastructure in predefined or custom machine sizes to accelerate your cloud transformation. General purpose (E2, N1, N2, N2D) machines provide a good balance of price and performance. Compute optimized (C2) machines offer high-end vCPU performance for compute-intensive workloads. Memory optimized (M2) machines offer the highest memory and are great for in-memory databases. Accelerator optimized (A2) machines are based on the A100 GPU, for very demanding applications.
-
5
Nen
neural network implementation in java
3-layer neural network for regression and classification with sigmoid activation function and command line interface similar to LibSVM. Quick Start: "java -jar nen.jar" -
6
SurveyForge is a survey definition and execution tool oriented to statisticians running on JEE platform with special emphasis on data entry made easy, use of existing standards (Triple-S, Metanet, DDI) and reuse of standard (or not) classifications
-
7
SNARLI (Simple Neural ARchitecture LIbrary) is a Java package containing a back-prop layer class and classes for the Self-Organizing Map and Incremental Growing Grid. The back-prop class supports sigma-pi connections and back-prop-through-time.
- Previous
- You're on page 1
- Next
