代码搜索:polynomial

找到约 5,111 项符合「polynomial」的源代码

代码结果 5,111
www.eeworm.com/read/246286/12743616

html polynomial.html

www.eeworm.com/read/245176/12813309

m polynomial.m

function ker = polynomial(arg) % POLYNOMIAL % % Construct a polynomial kernel object, % % K(x1, x2) = (x1*x2' + 1).^d; % % Examples: % % % default constructor (quadratic kernel, d = 2
www.eeworm.com/read/141307/13023367

h polynomial.h

void fill_list(FILE *finput , list_t poly); list_t poly_add(list_t poly_1,list_t poly_2); list_t poly_mul(list_t poly_1,list_t poly_2); void out_data(FILE *foutput , list_t poly);
www.eeworm.com/read/141307/13023370

cpp polynomial.cpp

#include #include #include "slist.h" void insert_data(list_t poly , node_t p_node) { node_t p_temp; int n = 0 ; for (p_temp = poly->head ; p_temp != NULL ;) {
www.eeworm.com/read/140850/13059633

m polynomial.m

function ker = polynomial(arg) % POLYNOMIAL % % Construct a polynomial kernel object, % % K(x1, x2) = (x1*x2' + 1).^d; % % Examples: % % % default constructor (quadratic kernel, d = 2
www.eeworm.com/read/240779/13198583

vi polynomial.vi

www.eeworm.com/read/310569/13649016

h polynomial.h

/* A head file for c++ programming and polynomial calculation. Copyright @ Tony.v.sh Tsinghua University */ /* A fetal mistake was discovered on Aug 11th 2003. When using "Polynomial b = c
www.eeworm.com/read/310569/13649018

cpp polynomial.cpp

#include "polynomial.h" int Polynomial :: _accuracy = 16; Polynomial :: Polynomial( double i ) { if( i == 0 ) { _degree = -1; _a = NULL; } else { _degree = 0; _a = new dou
www.eeworm.com/read/309656/13666761

dsp polynomial.dsp

# Microsoft Developer Studio Project File - Name="polynomial" - Package Owner= # Microsoft Developer Studio Generated Build File, Format Version 6.00 # ** DO NOT EDIT ** # TARGTYPE "Win32 (x86
www.eeworm.com/read/309656/13666762

dsw polynomial.dsw

Microsoft Developer Studio Workspace File, Format Version 6.00 # WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE! ###############################################################################