代码搜索：minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/151143/12232453
m seismic_examples2.m
% Seismic_examples2
% Example of the usage of seismic functions
clear all
presets
global S4M
% Create a minimum-phase wavelet
wavelet=s_create_wavelet({'type','min-phase'},{'s
www.eeworm.com/read/336724/12420334
h whirlpool.h
#ifndef WHIRLPOOL_H
#define WHIRLPOOL_H 1
#if defined(__cplusplus)
extern "C"
{
#endif
#ifndef PORTABLE_C__
#define PORTABLE_C__
#include
/* Definition of minimum-width int
www.eeworm.com/read/131520/14141995
m dfdnell.m
function nellip = dfdnell(Fp,Fs,Kp,Ks)
% dfdnell.m Minimum order of erf for a given spec
%
% Authors: Dejan V. Tosic, Miroslav D. Lutovac, 1999.03.08
% tosic@telekom.etf.bg.ac
www.eeworm.com/read/131520/14142005
m dfdnminq.m
function n = dfdnminq(Fp, Fs, Kp, Ks)
% dfdnminq.m DFD Minimum order of erf for minQ design
%
% Authors: Dejan V. Tosic, Miroslav D. Lutovac, 1999.02.08
% tosic@telekom.etf.bg
www.eeworm.com/read/131520/14142095
m dfdnell.m
function nellip = dfdnell(Fp,Fs,Kp,Ks)
% dfdnell.m Minimum order of erf for a given spec
%
% Authors: Dejan V. Tosic, Miroslav D. Lutovac, 1999.03.08
% tosic@telekom.etf.bg.ac
www.eeworm.com/read/131520/14142096
m dfdxminq.m
function [amax,fmax] = dfdxminq(n, Fp, Fs, Kp, Ks)
% dfdxminq.m DFD MinQ minimum selectivity
%
% Authors: Dejan V. Tosic, Miroslav D. Lutovac, 1999.03.08
% tosic@telekom.etf.bg
www.eeworm.com/read/131520/14142108
m dfdnminq.m
function n = dfdnminq(Fp, Fs, Kp, Ks)
% dfdnminq.m DFD Minimum order of erf for minQ design
%
% Authors: Dejan V. Tosic, Miroslav D. Lutovac, 1999.02.08
% tosic@telekom.etf.bg
www.eeworm.com/read/131520/14142499
m afdnminq.m
function n = afdnminq(Fp, Fs, Kp, Ks)
% afdnminq.m AFD minimum elliptic order for minQ design
%
% 2:31 16/2/99
%
% Authors: Dejan V. Tosic, Miroslav D. Lutovac, 1999.02.08
%
www.eeworm.com/read/120309/14806116
htm chap24.htm
Intro to Algorithms: CHAPTER 24: MINIMUM SPANNING TREES
www.eeworm.com/read/214167/15112277
cpp prg14_1.cpp
// File: prg14_1.cpp
// program illustrates pushHeap()/popHeap() for vectors vA and vB;
// vA is array-based tree for maximum heap and vB for minimum heap.
// loop copies 7 elements from arr to vA