代码搜索：INTERVAL
找到约 8,094 项符合「INTERVAL」的源代码
代码结果 8,094
www.eeworm.com/read/328976/12991366
m conf2mahal.m
% CONF2MAHAL - Translates a confidence interval to a Mahalanobis
% distance. Consider a multivariate Gaussian
% distribution of the form
%
% p(x) = 1/sqrt((2 * pi)^d *
www.eeworm.com/read/140851/13058764
m conf2mahal.m
% CONF2MAHAL - Translates a confidence interval to a Mahalanobis
% distance. Consider a multivariate Gaussian
% distribution of the form
%
% p(x) = 1/sqrt((2 * pi)^d *
www.eeworm.com/read/138798/13211698
m conf2mahal.m
% CONF2MAHAL - Translates a confidence interval to a Mahalanobis
% distance. Consider a multivariate Gaussian
% distribution of the form
%
% p(x) = 1/sqrt((2 * pi)^d *
www.eeworm.com/read/137022/13347616
s stopwatc.s
; Stopwatch primitives - used in sw.c
include asmglobal.h
public stopval,swstart
.CODE
dbase dw @Data
; start the interval timer
swstart proc far
push ax
; send the mode word to the 825
www.eeworm.com/read/136754/13362558
m mexhat.m
function mx = mexhat(a,ts,int)
%mx = mexhat(a,ts,int) creates a Mexican hat wavelet dilated to a factor,
%a. The sampling interval is ts. The samples of the wavelet are returned.
%The samples of th
www.eeworm.com/read/321200/13410752
c measure.c
/*----------------------------------------------------------------------------
* Name: MEASURE.C
* Purpose: Remote Measurement Recorder
* Version: V1.10
*--------------------
www.eeworm.com/read/318176/13484087
c williams.c
/*
* Program to factor big numbers using Williams (p+1) method.
* Works when for some prime divisor p of n, p+1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/318176/13484098
c pollard.c
/*
* Program to factor big numbers using Pollards (p-1) method.
* Works when for some prime divisor p of n, p-1 has itself
* only small factors.
* See "Speeding the Pollard and Elliptic Cu
www.eeworm.com/read/318176/13484221
cpp pollard.cpp
/*
* Program to factor big numbers using Pollards (p-1) method.
* Works when for some prime divisor p of n, p-1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve
www.eeworm.com/read/318176/13484342
cpp williams.cpp
/*
* Program to factor big numbers using Williams (p+1) method.
* Works when for some prime divisor p of n, p+1 has only
* small factors.
* See "Speeding the Pollard and Elliptic Curve