All Downloads are FREE. Search and download functionalities are using the official Maven repository.

Download JAR files tagged by approximation with all dependencies


approximation_2.12 from group fr.iscpif.viabilitree (version 2.0)

Group: fr.iscpif.viabilitree Artifact: approximation_2.12
Show all versions Show documentation Show source 
Download approximation_2.12.jar (2.0)
 

0 downloads
Artifact approximation_2.12
Group fr.iscpif.viabilitree
Version 2.0


jmotif-sax from group net.seninp (version 1.2.0)

An implementation of time series Symbolic Aggregate approXimation and HOTSAX algorithms.

Group: net.seninp Artifact: jmotif-sax
Show all versions Show documentation Show source 
Download jmotif-sax.jar (1.2.0)
 

1 downloads
Artifact jmotif-sax
Group net.seninp
Version 1.2.0
Last update 28. December 2021
Organization JMotif
URL https://github.com/jMotif/SAX
License GNU General Public License v2.0
Dependencies amount 6
Dependencies slf4j-api, logback-classic, junit, jcommander, jfreechart, maven-project-info-reports-plugin,
There are maybe transitive dependencies!

latentSemanticAnalysis from group nz.ac.waikato.cms.weka (version 1.0.5)

Performs latent semantic analysis and transformation of the data. Use in conjunction with a Ranker search. A low-rank approximation of the full data is found by specifying the number of singular values to use. The dataset may be transformed to give the relation of either the attributes or the instances (default) to the concept space created by the transformation.

Group: nz.ac.waikato.cms.weka Artifact: latentSemanticAnalysis
Show all versions Show documentation Show source 
Download latentSemanticAnalysis.jar (1.0.5)
 

0 downloads
Artifact latentSemanticAnalysis
Group nz.ac.waikato.cms.weka
Version 1.0.5
Last update 21. March 2017
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/latentSemanticAnalysis
License GNU General Public License 3
Dependencies amount 2
Dependencies weka-dev, weka-dev,
There are maybe transitive dependencies!

industrialbenchmark from group com.siemens.oss.industrialbenchmark (version 1.1.1)

A novel reinforcement learning benchmark, called Industrial Benchmark, is introduced. The Industrial Benchmark aims at being be realistic in the sense, that it includes a variety of aspects that we found to be vital in industrial applications. It is not designed to be an approximation of any real system, but to pose the same hardness and complexity.

Group: com.siemens.oss.industrialbenchmark Artifact: industrialbenchmark
Show all versions Show documentation Show source 
Download industrialbenchmark.jar (1.1.1)
 

0 downloads
Artifact industrialbenchmark
Group com.siemens.oss.industrialbenchmark
Version 1.1.1
Last update 11. November 2016
Organization not specified
URL http://github.com/siemens/industrialbenchmark
License Apache License, Version 2.0
Dependencies amount 10
Dependencies slf4j-log4j12, slf4j-api, commons-collections, commons-io, jchart2d, guava, junit, jcommander, commons-lang3, commons-math3,
There are maybe transitive dependencies!

jcobyla from group de.xypron.jcobyla (version 1.4)

COBYLA2 is an implementation of Powell's nonlinear derivative free constrained optimization that uses a linear approximation approach. The algorithm is a sequential trust region algorithm that employs linear approximations to the objective and constraint functions, where the approximations are formed by linear interpolation at n + 1 points in the space of the variables and tries to maintain a regular shaped simplex over iterations. It solves nonsmooth NLP with a moderate number of variables (about 100). Inequality constraints only. The initial point X is taken as one vertex of the initial simplex with zero being another, so, X should not be entered as the zero vector.

Group: de.xypron.jcobyla Artifact: jcobyla
Show all versions Show documentation Show source 
Download jcobyla.jar (1.4)
 

3 downloads
Artifact jcobyla
Group de.xypron.jcobyla
Version 1.4
Last update 31. May 2022
Organization not specified
URL https://github.com/xypron/jcobyla
License The MIT License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!

tagsoup from group com.github.fansu.tagsoup (version 1.0.5)

TagSoup is a SAX-compliant parser written in Java that, instead of parsing well-formed or valid XML, parses HTML as it is found in the wild: poor, nasty and brutish, though quite often far from short. TagSoup is designed for people who have to process this stuff using some semblance of a rational application design. By providing a SAX interface, it allows standard XML tools to be applied to even the worst HTML. TagSoup also includes a command-line processor that reads HTML files and can generate either clean HTML or well-formed XML that is a close approximation to XHTML.

Group: com.github.fansu.tagsoup Artifact: tagsoup
Show all versions Show documentation Show source 
Download tagsoup.jar (1.0.5)
 

1 downloads
Artifact tagsoup
Group com.github.fansu.tagsoup
Version 1.0.5
Last update 07. November 2018
Organization not specified
URL http://home.ccil.org/~cowan/XML/tagsoup/
License Apache License 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!

Diversity from group com.github.sergejzr.lib (version 0.0.1)

Group: com.github.sergejzr.lib Artifact: Diversity
Show documentation Show source 
Download Diversity.jar (0.0.1)
 

1 downloads
Artifact Diversity
Group com.github.sergejzr.lib
Version 0.0.1


tagsoup from group org.ccil.cowan.tagsoup (version 1.2.1)

Group: org.ccil.cowan.tagsoup Artifact: tagsoup
Show all versions Show documentation Show source 
Download tagsoup.jar (1.2.1)
 

44 downloads
Artifact tagsoup
Group org.ccil.cowan.tagsoup
Version 1.2.1


algorithms from group de.cit-ec.tcs.alignment (version 3.1.1)

This module defines the interface for AlignmentAlgorithms as well as some helper classes. An AlignmentAlgorithm computes an Alignment of two given input sequences, given a Comparator that works in these sequences. More details on the AlignmentAlgorithm can be found in the respective interface. More information on Comparators can be found in the comparators module. The resulting 'Alignment' may be just a real-valued dissimilarity between the input sequence or may incorporate additional information, such as a full Alignment, a PathList, a PathMap or a CooptimalModel. If those results support the calculation of a Gradient, they implement the DerivableAlignmentDistance interface. In more detail, the Alignment class represents the result of a backtracing scheme, listing all Operations that have been applied in one co-optimal Alignment. A classic AlignmentAlgorithm does not result in a differentiable dissimilarity, because the minimum function is not differentiable. Therefore, this package also contains utility functions for a soft approximation of the minimum function, namely Softmin. For faster (parallel) computation of many different alignments or gradients we also provide the ParallelProcessingEngine, the SquareParallelProcessingEngine and the ParallelGradientEngine.

Group: de.cit-ec.tcs.alignment Artifact: algorithms
Show all versions Show documentation Show source 
Download algorithms.jar (3.1.1)
 

0 downloads
Artifact algorithms
Group de.cit-ec.tcs.alignment
Version 3.1.1
Last update 26. October 2018
Organization not specified
URL http://openresearch.cit-ec.de/projects/tcs
License The GNU Affero General Public License, Version 3
Dependencies amount 3
Dependencies comparators, parallel, lombok,
There are maybe transitive dependencies!



Page 1 from 1 (items total 9)


© 2015 - 2024 Weber Informatics LLC | Privacy Policy