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

Download JAR files tagged by overall with all dependencies

Search JAR files by class name

crypto4j-parent from group org.beiter.michael.crypto4j (version 1.0)

The crypto4j library provides a simple and pluggable crypto abstraction library for Java, including both cryptographic primitives and the artifacts defined in the JOSE standard. This library separates the cryptographic primitives from the JOSE artifacts. The library uses the algorithms available through JCA (JCE). The implementations of the cryptographic primitives provided in this library rely on the standard JCA implementation, and can be configured and extended through the JCA mechanisms. The JOSE portion of the library allows custom extensions by either replacing the provided JOSE artifact implementations with custom implementations, or by adding new JOSE artifacts, for instance in form of additional algorithms, which is particularly useful in case that the JOSE standard is updated or in case custom extensions to the JOSE standard should be implemented. The implementations available in this library generally come in two variants: a standard implementation of the primitives and advanced algorithms, and a high-performance implementation that takes advantage of implementation patterns that do not compromise cryprographic security, but speed up the overall processing time.

Group: org.beiter.michael.crypto4j Artifact: crypto4j-parent
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact crypto4j-parent
Group org.beiter.michael.crypto4j
Version 1.0
Last update 23. January 2017
Organization Michael Beiter <[email protected]>
URL http://mbeiter.github.io/crypto4j/docs/${project.version}/
License BSD 3-clause Revised License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!

paceRegression from group nz.ac.waikato.cms.weka (version 1.0.2)

Class for building pace regression linear models and using them for prediction. Under regularity conditions, pace regression is provably optimal when the number of coefficients tends to infinity. It consists of a group of estimators that are either overall optimal or optimal under certain conditions. The current work of the pace regression theory, and therefore also this implementation, do not handle: - missing values - non-binary nominal attributes - the case that n - k is small where n is the number of instances and k is the number of coefficients (the threshold used in this implmentation is 20) For more information see: Wang, Y (2000). A new approach to fitting linear models in high dimensional spaces. Hamilton, New Zealand. Wang, Y., Witten, I. H.: Modeling for optimal probability prediction. In: Proceedings of the Nineteenth International Conference in Machine Learning, Sydney, Australia, 650-657, 2002.

Group: nz.ac.waikato.cms.weka Artifact: paceRegression
Show all versions Show documentation Show source 
 

0 downloads
Artifact paceRegression
Group nz.ac.waikato.cms.weka
Version 1.0.2
Last update 26. April 2012
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/paceRegression
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!



Page 3 from 3 (items total 22)


© 2015 - 2024 Weber Informatics LLC | Privacy Policy