代码搜索:binomial

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

代码结果 467
www.eeworm.com/read/403922/11500964

html function.stats-cdf-binomial.html

Calculates any one parameter of the binomial distribution given values fo
www.eeworm.com/read/375190/2739347

cpp negative_binomial_example2.cpp

// negative_binomial_example2.cpp // Copyright Paul A. Bristow 2007. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. // (See accompanying file LICENS
www.eeworm.com/read/375190/2739352

cpp negative_binomial_example1.cpp

// negative_binomial_example1.cpp // Copyright Paul A. Bristow 2007. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. // (See accompanying file LICENS
www.eeworm.com/read/375190/2739366

cpp neg_binomial_sample_sizes.cpp

// neg_binomial_sample_sizes.cpp // Copyright Paul A. Bristow 2007 // Copyright John Maddock 2006 // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. // (
www.eeworm.com/read/375190/2739615

cpp sf_binomial_incl_test.cpp

// Copyright John Maddock 2006. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boo
www.eeworm.com/read/375190/2739625

cpp dist_binomial_incl_test.cpp

// Copyright John Maddock 2006. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boo
www.eeworm.com/read/196909/8043454

html page368.html

Binomial Queues Data Structures and Al
www.eeworm.com/read/373627/9445754

index

Functions: ========= Null Null Spaces of Matrices addterm Try All One-Term Additions to a Model anova.negbin Likelihood Ratio Tests for Negative Binomial
www.eeworm.com/read/460181/7256272

m bhp.m

function h = bhp(k) % h = bhp(k) % Binomial hipass filter % H(z) = [(1/z-1)/2]^k h = 1; for i = 1:k h = ([0 h] - [h 0])/2; end
www.eeworm.com/read/460181/7256273

m blp.m

function h = blp(k) % h = blp(k) % Binomial lowpass filter % H(z) = [(1/z+1)/2]^k h = 1; for i = 1:k h = ([h 0] + [0 h])/2; end