代码搜索：Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/297039/8058274
m sgrpdlay.m
function [gd,fnorm]=sgrpdlay(x,fnorm);
%SGRPDLAY Group delay estimation of a signal.
% [GD,FNORM]=SGRPDLAY(X,FNORM) estimates the group delay of
% signal X at the normalized frequency(ies) FNORM.
%
%
www.eeworm.com/read/297034/8058854
m tfrview.m
function tfrview(tfr,sig,t,method,param,p1,p2,p3,p4,p5);
%TFRVIEW Visualization of time-frequency representations.
% TFRVIEW(TFR,SIG,T,METHOD,PARAM,P1,P2,P3,P4,P5)
% allows to visualize
www.eeworm.com/read/297034/8059259
m sgrpdlay.m
function [gd,fnorm]=sgrpdlay(x,fnorm);
%SGRPDLAY Group delay estimation of a signal.
% [GD,FNORM]=SGRPDLAY(X,FNORM) estimates the group delay of
% signal X at the normalized frequency(ies) FNORM.
%
%
www.eeworm.com/read/397111/8067367
m myparzen.m
function F = myparzen(a,h,b)
[nra,dim] = size(a);
if (nargin
www.eeworm.com/read/397106/8067872
txt algorithms.txt
Ada_Boost;Num iter, type, params:;[100,'Stumps',100];L
EM;nGaussians [clss0,clss1]:;[1,1];S
K_L_nn_Rule;[Nr Neighbors, l (nr samples in agreement)]:;[5,3];L
Local_Polynomial;Num of test points:;10;
www.eeworm.com/read/397102/8068003
m knnc.m
%KNNC K-Nearest Neighbor Classifier
%
% [W,k,e] = knnc(A,k)
%
% Computation of the k-nearest neigbor classifier for the dataset A.
% Default k: optimize leave-one-out error e. W is a mapping and
%
www.eeworm.com/read/296961/8068559
java computerpad.java
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
import javax.swing.border.*;
import java.util.LinkedList;
import java.text.NumberFormat;
public class ComputerPad extends Fram
www.eeworm.com/read/397099/8068720
txt classification.txt
Ada_Boost@Num iter, type, params:@[100,'Stumps',[]]@L
Backpropagation_Batch@Nh, Theta, Convergence rate:@[5, 0.1, 0.1]@L
Backpropagation_CGD@Nh, Theta:@[5, 0.1]@L
Backpropagation_Quickprop@Nh, Thet
www.eeworm.com/read/397097/8069185
m myparzen.m
function F = myparzen(a,h,b)
[nra,dim] = size(a);
if (nargin
www.eeworm.com/read/397008/8072546
java gede.java
package exec.day0911;
/**
* 歌德巴赫猜想,任何一个大于六的偶数可以拆分成两个质数的和
* 打印出所有的可能
* @author Administrator
*
*/
public class Gede {
public static void main(String[] args) {
int n = Integer.parseInt(