代码搜索结果

% test the forward dynamic programming algorithm % Copyright 1999 by Todd K. Moon H{2} = 1; H{3} = 1; H{4} = 1; H{5} = 1; H{6} = [2,4]; H{7} = [2,3]; H{8} = [3,4,5]; H{9} =

function [h,y] = lms(x,d,delta,N) % LMS Algorithm for Coefficient Adjustment % ---------------------------------------- % [h,y] = lms(x,d,delta,N) % h = estimated FIR filter % y = output

% make rp structure to be used for passing run % parameters to the run_lms_pred algorithm rp.Nruns = 100; rp.Ndata = 500; rp.mult = 200; rp.verbose = 0; rp.mu = 0.05; rp.a =

% ICA 4-order static algorithm without a goal function % Unrealtime,batch,maybe unsolved function [Y,W]=ST4(X) [m,T]=size(X); epsilon=1; % 特征值

function [x,esq,j] = kmeanlbg(d,k) %KMEANLBG Vector quantisation using the Linde-Buzo-Gray algorithm [X,ESQ,J]=(D,K) % %Inputs: % D contains data vectors (one per row) % K is number of centres re

function x = l2p_re(A,y,p,group) % Solution to the non-convex optimization problem min||x||_2,p subject to % y = Ax % This algorithm is based upon the Reweighted L2 algorithm from the % followi

#include #include #include template void print_elements( Type elem ) { cout

#include #include #include // #include /** ** stanl@john:d.12 338 : xsh32 ch12.4.02.c stanl@john:d.12 339 : a.out 0 1 1 2 3 5 8 0 1 1 2

GENERATORS sprand: SPRAND generator. spgrid: SPGRID generator. spacyc: SPACYC generator. SHORTEST PATHS CODES acc: special-purpose algorithm for acyclic networks. bf:

/* The Blog algorithm is mainly de-assembled out by SnowWings. */ /* We should thank him very much, because the algorithm is crucial. */ #include void InitializeBlog(const