代码搜索:binomial

找到约 467 项符合「binomial」的源代码

代码结果 467
www.eeworm.com/read/151143/12233112

m binom.m

function bin = binom(a,n,sign) % Function computes n binomial coefficients % 1 sign*a (sign^2)*a*(a-1)/2 (sign^3)*a*(a-1)*(a-2)/3! ... % If a is a positive integer n can be dropped (it is then
www.eeworm.com/read/125476/14491770

cc futures_opt_put_bin.cc

// file futures_opt_call_bin.cc // author: Bernt A Oedegaard #include #include #include using namespace std; double futures_option_price_put_american_binomial( double F,
www.eeworm.com/read/125476/14491843

cc currency_opt_bin_put.cc

// file currency_opt_bin_put.cc // author: Bernt A Oedegaard #include #include #include using namespace std; double currency_option_price_put_american_binomial(double S,
www.eeworm.com/read/453176/1642021

m namedfilter.m

% KERNEL = NAMED_FILTER(NAME) % % Some standard 1D filter kernels. These are scaled such that % their L2-norm is 1.0. % % binomN - binomial coefficient filter of order N-1 % haar:
www.eeworm.com/read/273525/4205172

ado cs.ado

*! version 3.4.14 18mar2005 program define cs, rclass sort version 6, missing syntax varlist(min=2 max=2) [if] [in] [fw] [, Binomial(varname) /* */ BY(varlist) noHom noHEt noCrude Exact ES
www.eeworm.com/read/273525/4209722

ado tab_or.ado

*! version 6.0.11 17mar2005 program define tab_or, rclass version 6, missing syntax varlist(min=2 max=2) [if] [in] [fweight] [, Binomial(string) /* */ ADJust(string) Level(cilevel) base(stri
www.eeworm.com/read/292863/8328508

m namedfilter.m

% KERNEL = NAMED_FILTER(NAME) % % Some standard 1D filter kernels. These are scaled such that % their L2-norm is 1.0. % % binomN - binomial coefficient filter of order N-1 % haar:
www.eeworm.com/read/292863/8328590

m namedfilter.m

% KERNEL = NAMED_FILTER(NAME) % % Some standard 1D filter kernels. These are scaled such that % their L2-norm is 1.0. % % binomN - binomial coefficient filter of order N-1 % haar:
www.eeworm.com/read/265723/11255433

m nchoosek.m

function c = nchoosek(v,k) %NCHOOSEK Binomial coefficient or all combinations. % NCHOOSEK(N,K) where N and K are non-negative integers returns N!/K!(N-K)!. % This is the number of combinations
www.eeworm.com/read/288479/8630431

m bincoef.m

function k = bincoef(n,N) %BINCOEF Binomial coefficients % % k = bincoef(n,N) % Anders Holtsberg, 13-05-94 % Copyright (c) Anders Holtsberg if all(all(round(n)==n)) & all(all(ro