Download JAR files tagged by arity with all dependencies
arity-n from group org.webjars.npm (version 1.0.4)
babel__helper-get-function-arity from group org.webjars.npm (version 7.16.7)
Group: org.webjars.npm Artifact: babel__helper-get-function-arity
Show all versions Show documentation Show source
Show all versions Show documentation Show source
0 downloads
aritiality from group net.ashwork (version 2.0.0-final)
A collection of arity-based functional interfaces.
Artifact aritiality
Group net.ashwork
Version 2.0.0-final
Last update 03. July 2021
Organization not specified
URL https://github.com/ChampionAsh5357/functionality
License MPL-2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.ashwork
Version 2.0.0-final
Last update 03. July 2021
Organization not specified
URL https://github.com/ChampionAsh5357/functionality
License MPL-2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
babel-helper-get-function-arity from group org.webjars.npm (version 7.0.0-beta.3)
WebJar for babel-helper-get-function-arity
Group: org.webjars.npm Artifact: babel-helper-get-function-arity
Show all versions Show documentation Show source
Show all versions Show documentation Show source
0 downloads
Artifact babel-helper-get-function-arity
Group org.webjars.npm
Version 7.0.0-beta.3
Last update 07. June 2019
Organization not specified
URL http://webjars.org
License MIT
Dependencies amount 2
Dependencies babel-runtime, babel-types,
There are maybe transitive dependencies!
Group org.webjars.npm
Version 7.0.0-beta.3
Last update 07. June 2019
Organization not specified
URL http://webjars.org
License MIT
Dependencies amount 2
Dependencies babel-runtime, babel-types,
There are maybe transitive dependencies!
funcles from group net.sourcedestination (version 2.0)
tuple and higher arity functional interface library for Java 8+
Artifact funcles
Group net.sourcedestination
Version 2.0
Last update 20. September 2017
Organization not specified
URL https://github.com/jmorwick/funcles
License GNU Lesser General Public License v3.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sourcedestination
Version 2.0
Last update 20. September 2017
Organization not specified
URL https://github.com/jmorwick/funcles
License GNU Lesser General Public License v3.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
composites from group com.github.nikita-volkov.java (version 1)
A lightweight library of multi-arity anonymous product- and sum-types for Java
Group: com.github.nikita-volkov.java Artifact: composites
Show all versions Show documentation Show source
Show all versions Show documentation Show source
0 downloads
Artifact composites
Group com.github.nikita-volkov.java
Version 1
Last update 12. July 2017
Organization not specified
URL http://github.com/nikita-volkov/composites.java
License MIT/X11
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group com.github.nikita-volkov.java
Version 1
Last update 12. July 2017
Organization not specified
URL http://github.com/nikita-volkov/composites.java
License MIT/X11
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
adp from group de.cit-ec.tcs.alignment (version 3.1.1)
This module contains a more general approach to construct
AlignmentAlgorithms by relying on the theoretical concept of Algebraic
Dynamic Programming (ADP) as developed by Giegerich et al.
ADP defines four ingredients for an alignment algorithm:
1.) A signature that defines the permitted alignment operations.
Operations are just function templates with an associated arity, meaning
the number of arguments it takes from the left sequence and from the
right sequence.
In the TCSAlignmentToolbox we have a fixed signature with the following
operations:
REPLACEMENT(1, 1), DELETION(1, 0), INSERTION(0, 1), SKIPDELETION(1, 0)
and SKIPINSERTION(0, 1)
2.) A regular tree grammar that produces alignments, that is: sequences
of operations, in a restricted fashion.
3.) An algebra that can translate such trees to a cost. In the
TCSAlignmentToolbox this is a Comparator.
4.) A choice function, in case of the TCSAlignmentToolbox: the strict
minimum or the soft minimum.
An alignment algorithm in the TCSAlignmentToolbox sense of the word then
is the combination of choice function and grammar. While we provide
hardcoded versions of these combinations in the main package, the adp
package allows you to create your own grammars. You can combine them with
a choice function by instantiating one of the Algorithm classes provided
in this package with a grammar of your choice.
For example:
AlignmentAlgorithm algo = new SoftADPScoreAlgorithm(my_grammar, comparator);
creates an alignment algorithm that implicitly produces all possible
alignments your grammar can construct with the given input, translates them
to a cost using the algebra/comparator you provided and applies the
soft minimum to return the score. This all gets efficient by dynamic
programming.
Note that there is runtime overhead when using this method in comparison
with the hardcoded algorithms. But for complicated grammars this is a much
easier way to go.
For more information on the theory, please refer to my master's thesis:
"Adaptive Affine Sequence Alignment using Algebraic Dynamic Programming"
0 downloads
Artifact adp
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 1
Dependencies algorithms,
There are maybe transitive dependencies!
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 1
Dependencies algorithms,
There are maybe transitive dependencies!
Page 1 from 1 (items total 7)
© 2015 - 2024 Weber Informatics LLC | Privacy Policy