代码搜索：complexity
找到约 493 项符合「complexity」的源代码
代码结果 493
www.eeworm.com/read/386996/8714322
c massey.c
/*
Author: Pate Williams (c) 1997
The following code tests an implementation of
the Berlekamp-Massey algorithm for finding the
linear complexity of a finite binary sequence.
Th
www.eeworm.com/read/428555/8859922
java question.java
//********************************************************************
// Question.java Author: Lewis/Loftus
//
// Represents a question (and its answer).
//*******************************
www.eeworm.com/read/184390/9107149
h count.h
/* Global counter variable for calculation of complexity weight */
#define MAXCOUNTERS 32767
typedef struct
{
Word32 add; /* Complexity Weight of 1 */
Word32 sub;
Word32 abs_s;
www.eeworm.com/read/167466/9968329
m fig10_7.m
%% Fig 10.7
%% Complexity of DFT/FFT
clf
t=1:14;
X=2.^t;
Y1 = X.^2;
Y2 = (X/2).*log2(X);
loglog(X,Y1,X,Y2);
hold on;
xlabel('Size of DFT/FFT Transform','Fontsize',12);
ylabel('Complexity','Fontsize',1
www.eeworm.com/read/362743/9983927
h gdsl_stack.h
/*
* This file is part of the Generic Data Structures Library (GDSL).
* Copyright (C) 1998-2006 Nicolas Darnis .
*
* The GDSL library is free software; you can redistribute it and
www.eeworm.com/read/166055/10038219
java question.java
//********************************************************************
// Question.java Author: Lewis/Loftus
//
// Represents a question (and its answer).
//*******************************
www.eeworm.com/read/166055/10038227
java 复件 question.java
//********************************************************************
// Question.java Author: Lewis/Loftus
//
// Represents a question (and its answer).
//*******************************
www.eeworm.com/read/466694/7031473
m test.m
%you've unpacked it and compiled all the mex files.
%now test it with the following
xi=randn(2,1);
for i=1:1000,
xi=ikeda(xi);
end;
x=[];
for i=1:3000,
xi=ikeda(xi)+randn(2,1)*0.01;
x=[x xi];
e
www.eeworm.com/read/466709/7031627
c complexitybs.c
/*=================================================================
*
* COMPLEXITYBS.C .MEX file corresponding to COMPLEXITYBS.M
* returns the Lempel-Ziv compexity, and approximate
*
www.eeworm.com/read/246726/12707018
c massey.c
/*
Author: Pate Williams (c) 1997
The following code tests an implementation of
the Berlekamp-Massey algorithm for finding the
linear complexity of a finite binary sequence.
This is