Download JAR files tagged by representations with all dependencies
openimaj from group org.openimaj (version 1.3.10)
OpenIMAJ (Open Intelligent Multimedia in Java) is a collection of libraries and tools for multimedia analysis written in the Java programming language. OpenIMAJ intends to be the first truly complete multimedia analysis library and contains modules for analysing images, videos, text, audio and even webpages. The OpenIMAJ image and video analysis and feature extraction modules contain methods for processing visual content and extracting state-of-the-art features, including SIFT. The OpenIMAJ clustering and nearest-neighbour libraries contain efficient, multi-threaded implementations of clustering algorithms including Hierarchical K-Means and Approximate K-Means. The clustering library makes it possible to easily create visual-bag-of-words representations for images and video with very large vocabularies. The text-analysis modules contain implementations of a statistical language classifier and low-level processing pipeline. A number of modules deal with content creation, including interactive slideshows and animations. The hardware integration modules allow cross-platform integration with devices including webcams, the Microsoft Kinect, and even devices such as GPS's. OpenIMAJ also incorporates a number of tools to enable extremely-large-scale multimedia analysis using a distributed computing approach based on Apache Hadoop.
Group: org.openimaj Artifact: openimaj
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact openimaj
Group org.openimaj
Version 1.3.10
Last update 09. February 2020
Organization The University of Southampton
URL http://www.openimaj.org
License New BSD
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group org.openimaj
Version 1.3.10
Last update 09. February 2020
Organization The University of Southampton
URL http://www.openimaj.org
License New BSD
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jung-parent from group net.sf.jung (version 2.1.1)
JUNG the Java Universal Network/Graph Framework--is a software
library that provides a common and extendible language for the
modeling, analysis, and visualization of data that can be
represented as a graph or network. It is written in Java, which
allows JUNG-based applications to make use of the extensive
built-in capabilities of the Java API, as well as those of other
existing third-party Java libraries. The JUNG architecture is
designed to support a variety of representations of entities and
their relations, such as directed and undirected graphs,
multi-modal graphs, graphs with parallel edges, and hypergraphs.
It provides a mechanism for annotating graphs, entities, and
relations with metadata. This facilitates the creation of
analytic tools for complex data sets that can examine the
relations between entities as well as the metadata attached to
each entity and relation. The current distribution of JUNG
includes implementations of a number of algorithms from graph
theory, data mining, and social network analysis, such as
routines for clustering, decomposition, optimization, random
graph generation, statistical analysis, and calculation of
network distances, flows, and importance measures (centrality,
PageRank, HITS, etc.). JUNG also provides a visualization
framework that makes it easy to construct tools for the
interactive exploration of network data. Users can use one of
the layout algorithms provided, or use the framework to create
their own custom layouts. In addition, filtering mechanisms are
provided which allow users to focus their attention, or their
algorithms, on specific portions of the graph.
Group: net.sf.jung Artifact: jung-parent
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung-parent
Group net.sf.jung
Version 2.1.1
Last update 07. September 2016
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.jung
Version 2.1.1
Last update 07. September 2016
Organization not specified
URL http://jrtom.github.io/jung/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
jung2 from group net.sf.jung (version 2.0.1)
JUNG the Java Universal Network/Graph Framework--is a software
library that provides a common and extendible language for the
modeling, analysis, and visualization of data that can be
represented as a graph or network. It is written in Java, which
allows JUNG-based applications to make use of the extensive
built-in capabilities of the Java API, as well as those of other
existing third-party Java libraries. The JUNG architecture is
designed to support a variety of representations of entities and
their relations, such as directed and undirected graphs,
multi-modal graphs, graphs with parallel edges, and hypergraphs.
It provides a mechanism for annotating graphs, entities, and
relations with metadata. This facilitates the creation of
analytic tools for complex data sets that can examine the
relations between entities as well as the metadata attached to
each entity and relation. The current distribution of JUNG
includes implementations of a number of algorithms from graph
theory, data mining, and social network analysis, such as
routines for clustering, decomposition, optimization, random
graph generation, statistical analysis, and calculation of
network distances, flows, and importance measures (centrality,
PageRank, HITS, etc.). JUNG also provides a visualization
framework that makes it easy to construct tools for the
interactive exploration of network data. Users can use one of
the layout algorithms provided, or use the framework to create
their own custom layouts. In addition, filtering mechanisms are
provided which allow users to focus their attention, or their
algorithms, on specific portions of the graph.
Group: net.sf.jung Artifact: jung2
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact jung2
Group net.sf.jung
Version 2.0.1
Last update 24. January 2010
Organization not specified
URL http://jung.sourceforge.net/site
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group net.sf.jung
Version 2.0.1
Last update 24. January 2010
Organization not specified
URL http://jung.sourceforge.net/site
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
chips-n-salsa from group org.cicirello (version 7.0.0)
Chips-n-Salsa is a Java library of customizable,
hybridizable, iterative, parallel, stochastic, and self-adaptive
local search algorithms. The library includes implementations of
several stochastic local search algorithms, including simulated
annealing, hill climbers, as well as constructive search algorithms
such as stochastic sampling. Chips-n-Salsa now also includes genetic
algorithms as well as evolutionary algorithms more generally. The
library very extensively supports simulated annealing. It includes
several classes for representing solutions to a variety of optimization
problems. For example, the library includes a BitVector class that
implements vectors of bits, as well as classes for representing
solutions to problems where we are searching for an optimal vector
of integers or reals. For each of the built-in representations, the
library provides the most common mutation operators for generating
random neighbors of candidate solutions, as well as common crossover
operators for use with evolutionary algorithms. Additionally, the
library provides extensive support for permutation optimization
problems, including implementations of many different mutation
operators for permutations, and utilizing the efficiently implemented
Permutation class of the JavaPermutationTools (JPT) library.
Chips-n-Salsa is customizable, making extensive use of Java's generic
types, enabling using the library to optimize other types of representations
beyond what is provided in the library. It is hybridizable, providing
support for integrating multiple forms of local search (e.g., using a hill
climber on a solution generated by simulated annealing), creating hybrid
mutation operators (e.g., local search using multiple mutation operators),
as well as support for running more than one type of search for the same
problem concurrently using multiple threads as a form of algorithm portfolio.
Chips-n-Salsa is iterative, with support for multistart metaheuristics,
including implementations of several restart schedules for varying the run
lengths across the restarts. It also supports parallel execution of multiple
instances of the same, or different, stochastic local search algorithms for
an instance of a problem to accelerate the search process. The library
supports self-adaptive search in a variety of ways, such as including
implementations of adaptive annealing schedules for simulated annealing,
such as the Modified Lam schedule, implementations of the simpler annealing
schedules but which self-tune the initial temperature and other parameters,
and restart schedules that adapt to run length.
0 downloads
Artifact chips-n-salsa
Group org.cicirello
Version 7.0.0
Last update 01. August 2024
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!
Group org.cicirello
Version 7.0.0
Last update 01. August 2024
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!
Page 22 from 22 (items total 214)