代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/225226/14549080
m super_cycle.m
function y = super_cycle();
%use recursion to get the superiority cycle of the P wave
%close all
global data;
if nargin==0
start = 10;
t = 10;
else if nargin == 1
t = 10;
www.eeworm.com/read/222424/14691969
m spiking.m
function [f,o] = spiking(d,NF,mu);
%SPIKING: Spiking deconvolution using Levinson's recursion
%
% [f,o] = spiking(d,NF,mu)
%
% IN d: data (a column trace)
% NF: lenght of the spiking
www.eeworm.com/read/114456/15052845
m durlev.m
function [ar,rc,PE] = durlev(ACF);
% function [ar,rc,PE] = durlev(ACF);
% estimates AR(p) model parameter by solving the
% Yule-Walker with the Durbin-Levinson recursion
% for multiple channels
%
www.eeworm.com/read/114436/15053573
txt @psc_readme_2673_3.txt
Title: BST - Binary Search Tree
Description: Binary Search Tree - with additional recursion functions (smallest, parent & successor) etc.
This file came from Planet-Source-Code.com...the home millio
www.eeworm.com/read/210914/4946956
m levinson4toeplitz.m
function x=levinson4toeplitz(ac,rhs)
% Solve the linear system of equations Tx = r using Levinson's recursion;
% T is the Toeplitz matrix
% ( ac(1) ac(2) ac(3) ... )
%
www.eeworm.com/read/200523/5064791
m create_rowset.m
function result = create_rowset(data)
[s,i]=sort(data(:,1));
data=data(i,:);
if( size(data,2) == 1 ) # This was the last column, terminate the
# recursion
result=create_set(data)';
www.eeworm.com/read/371704/2779270
m levinson4toeplitz.m
function x=levinson4toeplitz(ac,rhs)
% Solve the linear system of equations Tx = r using Levinson's recursion;
% T is the Toeplitz matrix
% ( ac(1) ac(2) ac(3) ... )
%
www.eeworm.com/read/300465/13912140
m spiking.m
function [f,o] = spiking(d,NF,mu);
%SPIKING: Spiking deconvolution using Levinson's recursion
%
% [f,o] = spiking(d,NF,mu)
%
% IN d: data (a column trace)
% NF: lenght of the spiking