代码搜索:complexity
找到约 493 项符合「complexity」的源代码
代码结果 493
www.eeworm.com/read/411026/11261064
h sbc_math.h
/*
*
* Bluetooth low-complexity, subband codec (SBC) library
*
* Copyright (C) 2004-2007 Marcel Holtmann
* Copyright (C) 2004-2005 Henryk Ploetz
*
www.eeworm.com/read/208175/15251662
c exercise-8.c
/* Exercise 8
The simple voice recorder from exercise 6, modified to use a low-complexity ADPCM codec to
quadruple the storage time.
*/
#include
#include
#
www.eeworm.com/read/366702/2868853
c static18.c
// PR c++/23914
template
struct foo_template {
static const unsigned complexity = 0;
};
template struct STATIC_ASSERTION {};
void gcc_402_problem_minimal()
{
sizeof(S
www.eeworm.com/read/291387/8422096
txt ehist.txt
Complexity: 3 on 9 X-validation: 1 on 10
Consequents optimization. SSE=185.372
Premise optimization: 0/3 epochs, mu = 0.001, SSE= 185.372.
Premise optimization: 1/3 epochs, mu = 0.0001, SSE= 14
www.eeworm.com/read/440926/7678981
m bpcs.m
% Bit Plane Complexity Segmentation watermarking
% Input: 512x512 3 channel TIFF
% Output: 512x512 3 channel watermarked image
function lena3 = bpcs(filename)
preprocess;
lena = imread(filena
www.eeworm.com/read/353195/10463961
out stat.out
rate control: sequence initialization
initial global complexity measures (I,P,B): Xi=2782609, Xp=1043478, Xb=730435
reaction parameter: r=160000
initial virtual buffer fullness (I,P,B): d0i=51
www.eeworm.com/read/420640/10784543
out stat.out
rate control: sequence initialization
initial global complexity measures (I,P,B): Xi=2782609, Xp=1043478, Xb=730435
reaction parameter: r=160000
initial virtual buffer fullness (I,P,B): d0i=51
www.eeworm.com/read/147682/5728123
m asptrcpbfdaf.m
% [W,X,x,y,e,Px,ci,w]=asptrcpbfdaf(M,x,xn,dn,X,W,mu,n,c,b,Px,ci)
%
% Performs filtering and coefficient update using the
% Reduced Complexity Partitioned Block Frequency Domain
% Adapti
www.eeworm.com/read/336927/12407338
out stat.out
rate control: sequence initialization
initial global complexity measures (I,P,B): Xi=556522, Xp=208696, Xb=146087
reaction parameter: r=32000
initial virtual buffer fullness (I,P,B): d0i=10323
www.eeworm.com/read/487231/1240451
c cutter.c
/*
Problem: Tin Cutter
Author: Jan Kotas
Algorithm: interval compression & floodfill
Complexity: n^2
*/
#include
#include
#include
int x[256];
int y[256];
int s