代码搜索：splitting
找到约 525 项符合「splitting」的源代码
代码结果 525
www.eeworm.com/read/309003/3708883
m buildfbitree.m
function btree = BuildFBITree(D)
% BuildFBITree -- Build the 2-d Basis Tree for fingerprint compression
% Usage
% btree = BuildFBITree(D);
% Inputs
% D maximum depth of splitting (
www.eeworm.com/read/400494/2352283
texi arith.texi
@node Arithmetic, Date and Time, Mathematics, Top
@chapter Low-Level Arithmetic Functions
This chapter contains information about functions for doing basic
arithmetic operations, such as splitting a
www.eeworm.com/read/102720/15760975
c restorrb.c
/*
FIPS - the First nondestructive Interactive Partition Splitting program
Module restorrb.c
Copyright (C) 1993 Arno Schaefer
This program is free software; you can redistribut
www.eeworm.com/read/100195/15881306
c restorrb.c
/*
FIPS - the First nondestructive Interactive Partition Splitting program
Module restorrb.c
Copyright (C) 1993 Arno Schaefer
This program is free software; you can redistribut
www.eeworm.com/read/292143/8375241
bas comp_reducerhalfdict.bas
Attribute VB_Name = "Comp_ReducerHalfDict"
Option Explicit
'This is a 2 run method
'this reducer works by splitting a 256 chars dictionary into 128
'dictionaries of 2 chars each
'it will
www.eeworm.com/read/389184/8544800
m huff06.m
function varargout = Huff06(xC, ArgLevel, ArgSpeed)
% Huff06 Huffman encoder/decoder with (or without) recursive splitting
% Vectors of integers are Huffman encoded,
% these vectors are colle
www.eeworm.com/read/431675/8662457
m treec.m
%TREEC Build a decision tree classifier
%
% W = treec(A,crit,prune,T)
%
% Computation of a decision tree classifier out of a dataset A using
% a binary splitting criterion crit:
% infcrit - inf
www.eeworm.com/read/386050/8769667
m treec.m
%TREEC Build a decision tree classifier
%
% W = TREEC(A,CRIT,PRUNE,T)
%
% Computation of a decision tree classifier out of a dataset A using
% a binary splitting criterion CRIT:
% INFCRIT - i
www.eeworm.com/read/278030/10579724
bas comp_reducerhalfdict.bas
Attribute VB_Name = "Comp_ReducerHalfDict"
Option Explicit
'This is a 2 run method
'this reducer works by splitting a 256 chars dictionary into 128
'dictionaries of 2 chars each
'it will
www.eeworm.com/read/418695/10935742
m treec.m
%TREEC Build a decision tree classifier
%
% W = treec(A,crit,prune,T)
%
% Computation of a decision tree classifier out of a dataset A using
% a binary splitting criterion crit:
% infcrit - inf