代码搜索：complexity
找到约 493 项符合「complexity」的源代码
代码结果 493
www.eeworm.com/read/272894/10937389
dpr ex.dpr
{
Complexity: O(Sqrt(N)*Q), here Q is the amount of requiring.
Divide the list of block into the O(Sqrt(N)) segments.
Record the minimum time of the segment whose length is O(Sqrt(N)).
FindM
www.eeworm.com/read/368822/9676747
cpp zju2279 -- in the mirror.cpp
// PROB Zju Online Judge 2279 -- In the Mirror
// Algorithm BFS
// Complexity O(10*10*2^10)
// Author LoveShsean
#include
#include
#define maxn 12
#def
www.eeworm.com/read/430906/8719456
h single_list.h
/**Author jmanous..*/
/**A Little nice list with n complexity.Hope not so may SIGSEGV*/
enum {
ASCII,
SOUND,
MULTIMEDIA,
NOTYPE
};
typedef struct sNode {
int id;
int type;
int size;
struct s
www.eeworm.com/read/440941/7678825
m spread.m
% A Block Complexity based Data Embedding watermarking alrogithm
% Input: 512x512 3 channel TIFF
% Output: res = 512x512 3 channel watermarked image
% original = original image, for compari
www.eeworm.com/read/140847/5779215
m hhmm_jtree_clqs.m
% Find out how big the cliques are in an HHMM as a function of depth
% (This is how we get the complexity bound of O(D K^{1.5D}).)
if 0
Qsize = [];
Fsize = [];
Nclqs = [];
end
ds = 1:15;
for d = ds
www.eeworm.com/read/133943/5897399
m hhmm_jtree_clqs.m
% Find out how big the cliques are in an HHMM as a function of depth
% (This is how we get the complexity bound of O(D K^{1.5D}).)
if 0
Qsize = [];
Fsize = [];
Nclqs = [];
end
ds = 1:15;
for d = ds
www.eeworm.com/read/209260/15224726
c count.c
/* Version 2.0 Last modified: 6/30/95 */
#include
#include "typedef.h"
#include "count.h"
/* global counter variable for calculation of complexity weight */
BASIC_OP counter;
www.eeworm.com/read/251838/4414622
m hhmm_jtree_clqs.m
% Find out how big the cliques are in an HHMM as a function of depth
% (This is how we get the complexity bound of O(D K^{1.5D}).)
if 0
Qsize = [];
Fsize = [];
Nclqs = [];
end
ds = 1:15;
for d = ds
www.eeworm.com/read/251522/4418907
m hhmm_jtree_clqs.m
% Find out how big the cliques are in an HHMM as a function of depth
% (This is how we get the complexity bound of O(D K^{1.5D}).)
if 0
Qsize = [];
Fsize = [];
Nclqs = [];
end
ds = 1:15;
for d = ds
www.eeworm.com/read/215485/4903584
m hhmm_jtree_clqs.m
% Find out how big the cliques are in an HHMM as a function of depth
% (This is how we get the complexity bound of O(D K^{1.5D}).)
if 0
Qsize = [];
Fsize = [];
Nclqs = [];
end
ds = 1:15;
for d = ds