These instances, whenmapped to an n-dimensional space, represent a core set that can be
used to construct an approximation to theminimumenclosing ball. Solving the SVMlearning
problem on these core sets can produce a good approximation solution in very fast speed.
For example, the core-vector machine [81] thus produced can learn an SVM for millions of
data in seconds.
多項(xiàng)式擬合的MATLAB工具。只要具有以下幾個(gè)函數(shù)
POLYFITN - A general n-dimensional polynomial fitting tool
POLYVALN - An evaluation tool for polynomials produced by polyfitn
POLYN2SYMPOLY - A conversion tool to generate a sympoly from the results of polyfitn
POLYN2SYM - A conversion tool to generate a symbolic toolbox object from the results of polyfitn
Abtract - We propose a new family of fi lter banks,
named NDFB, that can achieve the directional decomposition
of arbitrary n-dimensional (N ≥ 2) signals with a simple and
effi cient tree-structured construction.
This is a package to calculate Discrete Fourier/Cosine/Sine Transforms of 1-dimensional sequences of length 2^N. This package contains C and Fortran FFT codes.
This is a simple one dimensional Fast Fourier Transform (and Inverse FFT) test program. FFT(and Inverse FFT) is implemeted as a function. 2^n-point FFT is possible.