Result:
found more than 396 distributions - search limited to the first 2001 files matching your query
( run in 0.768 )
Algorithm-KNN-XS
view release on metacpan or search on metacpan
lib_ann_interface.h view on Meta::CPAN
#include <ANN/ANN.h> // http://www.cs.umd.edu/~mount/ANN/
#include <ANN/ANNperf.h> // http://www.cs.umd.edu/~mount/ANN/
using namespace std;
class InvalidParameterValueException : public std::exception {
public:
explicit InvalidParameterValueException(const std::string& what) : m_what(what) {}
virtual ~InvalidParameterValueException() throw() {}
virtual const char * what() const throw() {
return m_what.c_str();
}
lib_ann_interface.h view on Meta::CPAN
};
// libANN can do a exit(1) if a a given dump file is incorrect
class LibANNInterface {
public:
LibANNInterface(std::vector< std::vector<double> >&, string&, bool, int, int, int);
~LibANNInterface();
void set_annMaxPtsVisit(int);
std::vector< std::vector<double> > annkSearch(std::vector<double>&, int, double);
Algorithm-KernelKMeans
view release on metacpan or search on metacpan
inc/Module/Install/Metadata.pm view on Meta::CPAN
my $license_text = shift or return;
my @phrases = (
'(?:under )?the same (?:terms|license) as (?:perl|the perl (?:\d )?programming language)' => 'perl', 1,
'(?:under )?the terms of (?:perl|the perl programming language) itself' => 'perl', 1,
'Artistic and GPL' => 'perl', 1,
'GNU general public license' => 'gpl', 1,
'GNU public license' => 'gpl', 1,
'GNU lesser general public license' => 'lgpl', 1,
'GNU lesser public license' => 'lgpl', 1,
'GNU library general public license' => 'lgpl', 1,
'GNU library public license' => 'lgpl', 1,
'GNU Free Documentation license' => 'unrestricted', 1,
'GNU Affero General Public License' => 'open_source', 1,
'(?:Free)?BSD license' => 'bsd', 1,
'Artistic license' => 'artistic', 1,
'Apache (?:Software )?license' => 'apache', 1,
Algorithm-Kmeanspp
view release on metacpan or search on metacpan
inc/Module/Install/Metadata.pm view on Meta::CPAN
\z
/ixms ) {
my $license_text = $1;
my @phrases = (
'under the same (?:terms|license) as (?:perl|the perl programming language) itself' => 'perl', 1,
'GNU general public license' => 'gpl', 1,
'GNU public license' => 'gpl', 1,
'GNU lesser general public license' => 'lgpl', 1,
'GNU lesser public license' => 'lgpl', 1,
'GNU library general public license' => 'lgpl', 1,
'GNU library public license' => 'lgpl', 1,
'BSD license' => 'bsd', 1,
'Artistic license' => 'artistic', 1,
'GPL' => 'gpl', 1,
'LGPL' => 'lgpl', 1,
'BSD' => 'bsd', 1,
Algorithm-LBFGS
view release on metacpan or search on metacpan
inc/Module/Install/Metadata.pm view on Meta::CPAN
)
{
my $license_text = $1;
my @phrases = (
'under the same (?:terms|license) as perl itself' => 'perl', 1,
'GNU public license' => 'gpl', 1,
'GNU lesser public license' => 'gpl', 1,
'BSD license' => 'bsd', 1,
'Artistic license' => 'artistic', 1,
'GPL' => 'gpl', 1,
'LGPL' => 'lgpl', 1,
'BSD' => 'bsd', 1,
Algorithm-LibLinear
view release on metacpan or search on metacpan
lib/Algorithm/LibLinear/Model.pm view on Meta::CPAN
If you have model files generated by LIBLINEAR's C<train> command or this class's C<save> method, you can C<load> them.
=head1 METHOD
Note that the constructor C<new> is B<not> a part of public API. You can get a instance via C<< Algorithm::LibLinaear->train >>. i.e., C<Algorithm::LibLinear> is a factory class.
=head2 load(filename => $path)
Class method. Loads a LIBLINEAR's model file and returns an instance of this class.
Algorithm-Line-Lerp
view release on metacpan or search on metacpan
}
if ($base || ! $API{$f}{ppport_fnc}) {
my $email = "Send email to perl5-porters\@perl.org if you need to have this functionality.\n";
if ($API{$f}{inaccessible}) {
print "\nThis is not part of the public API, and may not even be accessible to XS code.\n";
$info++;
}
elsif ($API{$f}{core_only}) {
print "\nThis is not part of the public API, and should not be used by XS code.\n";
$info++;
}
elsif ($API{$f}{deprecated}) {
print "\nThis is deprecated and should not be used. Convert existing uses.\n";
$info++;
# else
# define WIDEST_UTYPE U32
# endif
#endif
/* These could become provided if/when they become part of the public API */
#ifndef withinCOUNT
# define withinCOUNT(c, l, n) \
(((WIDEST_UTYPE) (((c)) - ((l) | 0))) <= (((WIDEST_UTYPE) ((n) | 0))))
#endif
Algorithm-Loops
view release on metacpan or search on metacpan
This is free and unencumbered software released into the public domain.
Anyone is free to copy, modify, publish, use, compile, sell, or
distribute this software, either in source code form or as a compiled
binary, for any purpose, commercial or non-commercial, and by any
means.
In jurisdictions that recognize copyright laws, the author or authors
of this software dedicate any and all copyright interest in the
software to the public domain. We make this dedication for the benefit
of the public at large and to the detriment of our heirs and
successors. We intend this dedication to be an overt act of
relinquishment in perpetuity of all present and future rights to this
software under copyright law.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
Algorithm-MinMax
view release on metacpan or search on metacpan
our @ISA = qw(Exporter);
# Items to export into callers namespace by default. Note: do not export
# names by default without a very good reason. Use EXPORT_OK instead.
# Do not simply export all your public functions/methods/constants.
# This allows declaration use Algorithm::MinMax ':all';
# If you do not need this, moving things directly into @EXPORT or @EXPORT_OK
# will save memory.
our %EXPORT_TAGS = ( 'all' => [ qw(
Algorithm-NCS
view release on metacpan or search on metacpan
Algorithm-NCS/lib/Algorithm/NCS.pm view on Meta::CPAN
our @ISA = qw(Exporter);
# Items to export into callers namespace by default. Note: do not export
# names by default without a very good reason. Use EXPORT_OK instead.
# Do not simply export all your public functions/methods/constants.
# This allows declaration use Algorithm::NCS ':all';
# If you do not need this, moving things directly into @EXPORT or @EXPORT_OK
# will save memory.
our %EXPORT_TAGS = ( 'all' => [ qw(
Algorithm-Networksort
view release on metacpan or search on metacpan
lib/Algorithm/Networksort.pm view on Meta::CPAN
B<Designing Sorting Networks: A New Paradigm>, Springer-Verlag, 2011
=item
Kenneth Batcher's web site (L<http://www.cs.kent.edu/~batcher/>) lists
his publications, including his paper listed above.
=back
=head1 AUTHOR
Algorithm-Odometer-Tiny
view release on metacpan or search on metacpan
- Reorganized module code a tiny bit
- Several doc updates, such as mentioning the Cartesian product and
linking to other modules
0.02 Sat, Oct 5 2019 commit 06ec85554be6ca9c23178ab51c8fc4bb4199eeb7
- first public release
Algorithm-QuadTree-XS
view release on metacpan or search on metacpan
}
if ($base || ! $API{$f}{ppport_fnc}) {
my $email = "Send email to perl5-porters\@perl.org if you need to have this functionality.\n";
if ($API{$f}{inaccessible}) {
print "\nThis is not part of the public API, and may not even be accessible to XS code.\n";
$info++;
}
elsif ($API{$f}{core_only}) {
print "\nThis is not part of the public API, and should not be used by XS code.\n";
$info++;
}
elsif ($API{$f}{deprecated}) {
print "\nThis is deprecated and should not be used. Convert existing uses.\n";
$info++;
# else
# define WIDEST_UTYPE U32
# endif
#endif
/* These could become provided if/when they become part of the public API */
#ifndef withinCOUNT
# define withinCOUNT(c, l, n) \
(((WIDEST_UTYPE) (((c)) - ((l) | 0))) <= (((WIDEST_UTYPE) ((n) | 0))))
#endif
Algorithm-QuadTree
view release on metacpan or search on metacpan
lib/Algorithm/QuadTree.pm view on Meta::CPAN
until we reach the leaves of the tree. Finally, we find all the objects that are
assigned to those leaf nodes and check them for overlap with the initial area.
=head1 CLASS METHODS
The following methods are public:
=over 4
=item I<Algorithm::QuadTree>-E<gt>B<new>(I<options>)
Algorithm-RabinKarp
view release on metacpan or search on metacpan
lib/Algorithm/RabinKarp.pm view on Meta::CPAN
in future versions.
=head1 SEE ALSO
"Winnowing: Local Algorithms for Document Fingerprinting"
L<http://theory.stanford.edu/~aiken/publications/papers/sigmod03.pdf>
Wikipedia: Rabin-Karp string search algorithm
L<http://en.wikipedia.org/wiki/Rabin-Karp>
=head1 AUTHOR
Algorithm-RandomMatrixGeneration
view release on metacpan or search on metacpan
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
Algorithm-SVM
view release on metacpan or search on metacpan
private:
double label;
struct svm_node *attributes;
int n; int max_n; int max_i;
bool realigned;
public:
DataSet(double l);
void setLabel(double l) { label = l; }
double getLabel() { return label; }
int getMaxI() { return max_i; }
void setAttribute(int k, double v);
~DataSet();
};
class SVM {
public:
SVM(int st, int kt, int d, double g, double c0, double C, double nu,
double e);
void addDataSet(DataSet *ds);
int saveModel(char *filename);
int loadModel(char *filename);
Algorithm-Scale2x
view release on metacpan or search on metacpan
inc/Module/Install/Metadata.pm view on Meta::CPAN
\z
/ixms ) {
my $license_text = $1;
my @phrases = (
'under the same (?:terms|license) as (?:perl|the perl programming language) itself' => 'perl', 1,
'GNU general public license' => 'gpl', 1,
'GNU public license' => 'gpl', 1,
'GNU lesser general public license' => 'lgpl', 1,
'GNU lesser public license' => 'lgpl', 1,
'GNU library general public license' => 'lgpl', 1,
'GNU library public license' => 'lgpl', 1,
'BSD license' => 'bsd', 1,
'Artistic license' => 'artistic', 1,
'GPL' => 'gpl', 1,
'LGPL' => 'lgpl', 1,
'BSD' => 'bsd', 1,
Algorithm-SocialNetwork
view release on metacpan or search on metacpan
lib/Algorithm/SocialNetwork.pod view on Meta::CPAN
=head1 SEE ALSO
[1] Ulrik Brandes,
A Faster Algorithm for Betweenness Centrality,
http://www.inf.uni-konstanz.de/algo/publications/b-fabc-01.pdf
L<Spiffy>,L<Graph>
=head1 COPYRIGHT
Algorithm-SpatialIndex-Strategy-MedianQuadTree
view release on metacpan or search on metacpan
lib/Algorithm/SpatialIndex/Strategy/MedianQuadTree.pm view on Meta::CPAN
A modified quad tree implementation that I'll call Median Quad Tree (MQT) in this document.
(Not sure if this data structure has a different name elsewhere.) See C<ALGORITHM>
below.
For a description of the public interface, see L<Algorithm::SpatialIndex>. This
spatial index strategy uses the default C<Algorithm::SpatialIndex::Strategy::QuadTree>
as a base class and gets away with containing very little code because of that.
This also means that most of the interface and behaviour is inherited.
=head1 ALGORITHM
Algorithm-SpatialIndex
view release on metacpan or search on metacpan
This takes precedence over limited bucket size and thus fixes
an issue with too many items being very close to one another
continuously overflowing buckets. [Marten Cieluch]
0.04 Sun Jan 23 14:00:00 CEST 2011
- Refactoring of the Strategy interface and public interface to
allow for 3D indexes.
- Introduction of the Algorithm::SpatialIndex::Strategy::2D
and Algorithm::SpatialIndex::Strategy::3D base classes for
2D/3D indexes.
- Introduction of the first implementation of an oct tree
Algorithm-Statistic
view release on metacpan or search on metacpan
Statistic.xs view on Meta::CPAN
/**
* Default comparator for numerics
*/
class PerlDefaultCompare {
public:
virtual ~PerlDefaultCompare() {}
virtual int operator()(SV* const x, SV* const y) const {
dTHX;
SV *z = x;
Statistic.xs view on Meta::CPAN
};
/**
* Extended comparator specified from perl
*/
class PerlCompare : public PerlDefaultCompare {
public:
PerlCompare(SV* compare) : compare_(compare), PerlDefaultCompare() {}
int operator()(SV* const x, SV* const y) const {
dTHX;
dSP;
Algorithm-TSort
view release on metacpan or search on metacpan
lib/Algorithm/TSort.pm view on Meta::CPAN
require Exporter;
our @ISA = qw(Exporter);
# Items to export into callers namespace by default. Note: do not export
# names by default without a very good reason. Use EXPORT_OK instead.
# Do not simply export all your public functions/methods/constants.
# This allows declaration use Algorithm::TSort ':all';
# If you do not need this, moving things directly into @EXPORT or @EXPORT_OK
# will save memory.
our %EXPORT_TAGS = ( 'all' => [ qw(
Algorithm-TokenBucket
view release on metacpan or search on metacpan
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
Algorithm-Tree-NCA
view release on metacpan or search on metacpan
our @ISA = qw(Exporter);
# Items to export into callers namespace by default. Note: do not export
# names by default without a very good reason. Use EXPORT_OK instead.
# Do not simply export all your public functions/methods/constants.
our @EXPORT_OK = ();
our @EXPORT = ();
our $VERSION = '0.02';
Algorithm-TrunkClassifier
view release on metacpan or search on metacpan
pod/TrunkClassifier.pod view on Meta::CPAN
trunk.
By default, classification is done by leave-one-out cross validation (LOOCV) meaning
that a single sample is used as test set, while the remaining samples are used to build
the classifier. This is done for every sample in the input dataset. See the the algorithm
publication for more details. A PubMed link can be found in L</"SEE ALSO">.
=head2 ARGUMENTS
Following installation, the algorithm can be run from the terminal using the
run_classifier.pl script supplied in the t/ folder. The command should be in this form
pod/TrunkClassifier.pod view on Meta::CPAN
=back
=head1 SEE ALSO
The publication describing the algorithm can be found in PubMed by this link:
L<http://www.ncbi.nlm.nih.gov/pubmed?Db=pubmed&Cmd=DetailsSearch&Term=23467331%5Buid%5D>
=head1 EXPORT
None by default. The runClassifier subroutine is exported on request.
Algorithm-VSM
view release on metacpan or search on metacpan
lib/Algorithm/VSM.pm view on Meta::CPAN
mentioned in Changes, one of them brought to my attention by Naveen Kulkarni.
=head1 AUTHOR
The author, Avinash Kak, recently finished a 17-year long "Objects Trilogy" project
with the publication of the book "B<Designing with Objects>" by John-Wiley. If
interested, check out his web page at Purdue to find out what the Objects Trilogy
project was all about. You might like "B<Designing with Objects>" especially if you
enjoyed reading Harry Potter as a kid (or even as an adult, for that matter). The
other two books in the trilogy are "B<Programming with Objects>" and "B<Scripting
with Objects>".
Algorithm-Verhoeff
view release on metacpan or search on metacpan
lib/Algorithm/Verhoeff.pm view on Meta::CPAN
our @ISA = qw(Exporter);
# Items to export into callers namespace by default. Note: do not export
# names by default without a very good reason. Use EXPORT_OK instead.
# Do not simply export all your public functions/methods/constants.
# This allows declaration use Algorithm::Verhoeff ':all';
# If you do not need this, moving things directly into @EXPORT or @EXPORT_OK
# will save memory.
our %EXPORT_TAGS = ( 'all' => [ qw(
Algorithm-Voting
view release on metacpan or search on metacpan
lib/Algorithm/Voting/Sortition.pm view on Meta::CPAN
(L<http://tools.ietf.org/html/rfc3797>):
=over 4
This document describes a method for making random selections in such a way
that the unbiased nature of the choice is publicly verifiable. As an example,
the selection of the voting members of the IETF Nominations Committee (NomCom)
from the pool of eligible volunteers is used. Similar techniques would be
applicable to other cases.
=back
Algorithm-WordLevelStatistics
view release on metacpan or search on metacpan
t/Relativity.test view on Meta::CPAN
THE STRUCTURE OF SPACE ACCORDING TO THE GENERAL THEORY OF RELATIVITY
(SUPPLEMENTARY TO SECTION 32)
Since the publication of the first edition of this little book, our
knowledge about the structure of space in the large (" cosmological
problem ") has had an important development, which ought to be
mentioned even in a popular presentation of the subject.
My original considerations on the subject were based on two
Alice
view release on metacpan or search on metacpan
inc/Module/Install/Metadata.pm view on Meta::CPAN
my $license_text = shift or return;
my @phrases = (
'(?:under )?the same (?:terms|license) as (?:perl|the perl (?:\d )?programming language)' => 'perl', 1,
'(?:under )?the terms of (?:perl|the perl programming language) itself' => 'perl', 1,
'Artistic and GPL' => 'perl', 1,
'GNU general public license' => 'gpl', 1,
'GNU public license' => 'gpl', 1,
'GNU lesser general public license' => 'lgpl', 1,
'GNU lesser public license' => 'lgpl', 1,
'GNU library general public license' => 'lgpl', 1,
'GNU library public license' => 'lgpl', 1,
'GNU Free Documentation license' => 'unrestricted', 1,
'GNU Affero General Public License' => 'open_source', 1,
'(?:Free)?BSD license' => 'bsd', 1,
'Artistic license 2\.0' => 'artistic_2', 1,
'Artistic license' => 'artistic', 1,
( run in 0.768 second using v1.01-cache-2.11-cpan-c6e0e5ac2a7 )