algorithm

• adler32 - Adler32 is a hash? algorithm CRC-32, except that it is much faster and carries a slightly higher probability of collisions
• Blowfish - An LLGPL CL implementation of the Blowfish encryption algorithm has been posted to comp
• Bordeaux-FFT - Bordeaux-FFT is a fast, pure-Lisp implementation of Fast Fourier Transforms
• cl-buchberger - cl-buchberger is a Common Lisp implementation of Buchberger's algorithm for the computation of Gröbner bases
• cl-grnm - cl-grnm is an implementation of the Nelder-Mead and Grid Restrained Nelder-Mead nonlinear optimization? algorithms
• CL-ID3 - CL-ID3 is a pure Common Lisp implementation of the well-known ID3 AI/data-mining algorithm
• cl-jointgen - CL-JOINTGEN is a Common Lisp implementation of the Joint Generation Algorithm for computing the dual of a monotone boolean function
• cl-satwrap - CL-SATWRAP is a thin generic SAT solver interface to your favorite `industrial-strength' SAT solver: Whichever code wins the next SATRace competition, it is easily glued on as a new backend, no need to change your CL code
• cl-unification - CL-Unification is a full blown unification library, supporting unification over any Common Lisp objects (and not just lists and atoms)
• CLLIB - CLLIB is a varied collection of Common lisp tools and routines in CLOCC
• CRC-32 - A library to compute the CRC-32 algorithm that is described in RFC 1952
• decisiontree - This package provides an implementation of an algorithm that creates a decision tree
• floyd-warshall - floyd-warshall is a (very) preliminary library for Floyd-Warshall all-pairs shortest-path algorithm computations on weighted directed Graph?s, written by Robert Goldman
• Levenshtein - The Levenshtein Distance algorithm finds the minimum number of operations needed to transform one string into the other, where an operation is an insertion, deletion, or substitution of a single character
• Mersenne Twister - The Mersenne Twister is a pseudorandom number generation algorithm created by Makoto Matsumoto
• PorterStemmer - The Porter Stemmer is a stemming text algorithm by Martin Porter
• SEMI-PRECIOUS - SEMI-PRECIOUS is a library of algorithms/data structures
• SHA1 - Secure Hash Algorithm 1 (SHA1) is defined in RFC 3174, and therefore more-or-less counts as a protocol
• SimpSamp - SimpSamp is a statistics library for simple random sampling without replacement
• Soundex - The Soundex algorithm indexes words by their sound when pronounced in English, for example to account for differences in spelling
• ulimyhmpqs - ulimyhmpqs is an implementation of the Hypercube Multiple Polynomial Quadratic Sieve (HMPQS), an algorithm for the factorisation of large (up to about 110 digits, where the Number Field Sieve (NFS) algorithms become more efficient) integers
• vas-string-metrics - vas-string-metrics provides the Jaro, Jaro-Winkler, Levenshtein, and normalized Levenshtein string distance/similarity metrics algorithms for text analysis

Pages in this topic: adler32   Blowfish   Bordeaux-FFT   cl-buchberger   cl-grnm   CL-ID3   cl-jointgen   cl-satwrap   cl-unification   CLLIB   CRC-32   decisiontree   floyd-warshall   Levenshtein   Mersenne Twister   PorterStemmer   SEMI-PRECIOUS   SHA1   SimpSamp   Soundex   ulimyhmpqs   vas-string-metrics  

CLiki pages can be edited by anyone at any time. Imagine a fearsomely comprehensive disclaimer of liability. Now fear, comprehensively