Algorithm::Merge - Three-way merge and diff River stage one • 2 direct dependents • 2 total dependents

JSMITH/Algorithm-Merge-0.08 - 22 Mar 2007 16:14:36 UTC

lib/RPerl/Algorithm/Sort/Merge.pm River stage one • 3 direct dependents • 3 total dependents

WBRASWELL/RPerl-7.000000 - 05 Jul 2020 01:35:58 UTC

Algorithm::C3 - A module for merging hierarchies using the C3 algorithm River stage three • 3 direct dependents • 502 total dependents

This module implements the C3 algorithm. I have broken this out into it's own module because I found myself copying and pasting it way too often for various needs. Most of the uses I have for C3 revolve around class building and metamodels, but it co...

HAARG/Algorithm-C3-0.11 - 10 Nov 2020 17:14:34 UTC

Algorithm::AdaBoost - AdaBoost learning algorithm River stage zero No dependents

AdaBoost is a machine learning algorithm proposed by Freund and Schapire. Using an arbitrary binary classification algorithm, The algorithm can construct a more accurate classifier (i.e. it is a meta-algorithm)....

SEKIA/Algorithm-AdaBoost-0.01 - 20 Oct 2012 08:54:18 UTC

Algorithm::SkipList - Perl implementation of skip lists River stage one • 1 direct dependent • 2 total dependents

This is an implementation of *skip lists* in Perl. Skip lists are similar to linked lists, except that they have random links at various *levels* that allow searches to skip over sections of the list, like so: 4 +---------------------------> +-------...

RRWO/Algorithm-SkipList-1.02 - 04 Jan 2005 23:19:11 UTC

IDS::Algorithm::MM - Learn or test using a first-order Markov Model (MM). River stage zero No dependents

Someday more will be here. Ideally, we would be using the algorithm from stolcke94bestfirst. Constructing a DFA rather than a NFA in effect has performed most of the state merging that stolcke93hidden do. Consider also a java or C/C++ implementaion: ...

INGHAM/IDS-Algorithms-1.02 - 09 Apr 2007 20:01:51 UTC

Algorithm::LibLinear - A Perl binding for LIBLINEAR, a library for classification/regression using linear SVM and logistic regression. River stage zero No dependents

Algorithm::LibLinear is an XS module that provides features of LIBLINEAR, a fast C library for classification and regression. Current version is based on LIBLINEAR 2.44, released on March 17, 2022....

SEKIA/Algorithm-LibLinear-0.24 - 04 Apr 2022 14:57:44 UTC

Algorithm::BloomFilter - A simple bloom filter data structure River stage one • 3 direct dependents • 5 total dependents

This module implements a simple bloom filter in C/XS....

SMUELLER/Algorithm-BloomFilter-0.02 - 13 Jun 2015 20:42:52 UTC

Algorithm::HyperLogLog - Implementation of the HyperLogLog cardinality estimation algorithm River stage one • 1 direct dependent • 1 total dependent

This module is implementation of the HyperLogLog algorithm. HyperLogLog is an algorithm for estimating the cardinality of a set....

HIDEAKIO/Algorithm-HyperLogLog-0.24 - 22 Jun 2017 17:48:21 UTC

Algorithm::Networksort - Create Sorting Networks. River stage one • 1 direct dependent • 1 total dependent

This module will create sorting networks, a sequence of comparisons that do not depend upon the results of prior comparisons. Since the sequences and their order never change, they can be very useful if deployed in hardware, or if used in software wi...

JGAMBLE/Algorithm-Networksort-2.02 - 21 Jun 2018 21:56:23 UTC

Algorithm::LineSegments - Piecewise linear function approximation River stage zero No dependents

This module takes discrete data points like time series data and computes a piecewise linear function, line segments, approximating them. It does this by merging groups of adjacent points into lines, always picking the pair that produces the smallest...

BJOERN/Algorithm-LineSegments-0.04 - 20 Mar 2014 18:46:35 UTC

Algorithm::VectorClocks - Generating a partial ordering of events in a distributed system River stage zero No dependents

Description, shamelessly stolen from Wikipedia: Vector Clocks is an algorithm for generating a partial ordering of events in a distributed system. Just as in Lamport timestamps, interprocess messages contain the state of the sending process's logical...

TAKERU/Algorithm-VectorClocks-v0.1.2 - 15 May 2010 14:06:13 UTC

Algorithm::KernelKMeans - Weighted kernel k-means clusterer River stage zero No dependents

"Algorithm::KernelKMeans" provides weighted kernel k-means vector clusterer. Note that this is a very early release. All APIs may be changed incompatibly. IMPLEMENTATION This class is just a placeholder. Implementation code is in other class and this...

SEKIA/Algorithm-KernelKMeans-0.03 - 10 Nov 2010 15:16:15 UTC

Algorithm::Functional::BFS - A functional approach to the breadth-first search algorithm. River stage zero No dependents

CWW/Algorithm-Functional-BFS-0.01 - 06 Jul 2012 04:55:18 UTC

Algorithm::KernelKMeans::PP River stage zero No dependents

This class is a pure-Perl implementation of weighted kernel k-means algorithm. Algorithm::KernelKMeans inherits this class by default....

SEKIA/Algorithm-KernelKMeans-0.03 - 10 Nov 2010 15:16:15 UTC

Algorithm::Numerical::Sample - Draw samples from a set River stage zero No dependents

This package gives two methods to draw fair, random samples from a set. There is a procedural interface for the case the entire set is known, and an object oriented interface when the a set with unknown size has to be processed. A: "sample (set => AR...

ABIGAIL/Algorithm-Numerical-Sample-2010011201 - 12 Jan 2010 14:55:10 UTC

Algorithm::Numerical::Shuffle - Shuffle a list. River stage one • 4 direct dependents • 4 total dependents

"shuffle" performs a one pass, fair shuffle on a list. If the list is passed as a reference to an array, the shuffle is done in situ. The subroutine returns the list in list context, and a reference to the list in scalar context....

ABIGAIL/Algorithm-Numerical-Shuffle-2009110301 - 03 Nov 2009 11:47:20 UTC

Algorithm::Graphs::TransitiveClosure - Calculate the transitive closure. River stage zero No dependents

This is an implementation of the well known *Floyd-Warshall* algorithm. [1,2] The subroutine "floyd_warshall" takes a directed graph, and calculates its transitive closure, which will be returned. The given graph is actually modified, so be sure to p...

ABIGAIL/Algorithm-Graphs-TransitiveClosure-2009110901 - 09 Nov 2009 22:52:55 UTC

Algorithm::LinearManifoldDataClusterer - for clustering data that resides on a low-dimensional manifold in a high-dimensional measurement space River stage zero No dependents

If you are new to machine learning and data clustering on linear and nonlinear manifolds, your first question is likely to be: What is a manifold? A manifold is a space that is locally Euclidean. And a space is locally Euclidean if it allows for the ...

AVIKAK/Algorithm-LinearManifoldDataClusterer-1.01 - 09 Jan 2015 18:39:55 UTC
19 results (0.035 seconds)