代码搜索：Method
找到约 10,000 项符合「Method」的源代码
代码结果 10,000
www.eeworm.com/read/494289/6381532
c brick.c
/*
* Test program to implement the Comb method for fast
* computation of g^x mod n, for fixed g and n, using precomputation.
* This idea can be used to substantially speed up certain phas
www.eeworm.com/read/494289/6381586
cpp ebrick.cpp
/*
* Test program to implement the Comb method for fast
* computation of e.G on the elliptic curve E(F_p) for fixed G and E,
* using precomputation.
* This idea can be used to substa
www.eeworm.com/read/494289/6381773
cpp ebrick2.cpp
/*
* Test program to implement Comb method for fast
* computation of x.G, on the elliptic curve E(F_2^m) for fixed G and E,
* using precomputation.
* This idea can be used to substan
www.eeworm.com/read/494289/6381832
cpp brick.cpp
/*
* Test program to implement Comb method for fast
* computation of g^x mod n, for fixed g and n, using precomputation.
* This idea can be used to substantially speed up certain phases
www.eeworm.com/read/493665/6388722
cpp acthandler.cpp
/*
*********************************************************************************
* In the name of Almighty *
*
www.eeworm.com/read/493843/6391471
m durbin.m
function b = durbin(x,p,q)
%DURBIN Find a moving average model using Durbin's method
%----
%USAGE: b = durbin(x,p,q)
%
% A moving average model for the input sequence x is found
% using Durbin'
www.eeworm.com/read/493843/6391497
m covm.m
function [a,err] = covm(x,p)
%COVM Find an all-pole model using the covariance method
%----
%USAGE: [a,err] = covm(x,p)
%
% An all-pole of order p is found for the input sequence
% x using the