代码搜索：sequential
找到约 1,846 项符合「sequential」的源代码
代码结果 1,846
www.eeworm.com/read/175688/9536142
m smo.m
function model = smo( data, options, init_model)
% SMO Sequential Minimal Optimization for binary SVM with L1-soft margin.
%
% Synopsis:
% model = smo( data )
% model = smo( data, options )
% model
www.eeworm.com/read/364233/9917641
txt readme.txt
SVM-JAVA: A simple Java implementation of SMO (Sequential Minimal Optimization) for training SVM
Developed by
Xiaoqian Jiang (xiaoqian@cs.cmu.edu)
Hwanjo Yu (hwanjoyu@postech.ac.kr)
Using Th
www.eeworm.com/read/362246/10010097
m smo.m
function model = smo( data, options, init_model)
% SMO Sequential Minimal Optimization for binary SVM with L1-soft margin.
%
% Synopsis:
% model = smo( data )
% model = smo( data, options )
% model
www.eeworm.com/read/280595/10311872
m smo.m
function model = smo( data, options, init_model)
% SMO Sequential Minimal Optimization for binary SVM with L1-soft margin.
%
% Synopsis:
% model = smo( data )
% model = smo( data, options )
% model
www.eeworm.com/read/470894/6901300
m calcmofncfarthreshold.m
function [T,M,P1] = calcMofNCFARthreshold(nTest, nRef, N, thePFA)
% calculates classical 2-threshold radar detector CFAR thresholds
% for 0-mean unknown, but constant variance AWGN for N sequential
www.eeworm.com/read/466591/7029505
m smo.m
function model = smo( data, options, init_model)
% SMO Sequential Minimal Optimization for binary SVM with L1-soft margin.
%
% Synopsis:
% model = smo( data )
% model = smo( data, options )
% model
www.eeworm.com/read/299459/7850427
m smo.m
function model = smo( data, options, init_model)
% SMO Sequential Minimal Optimization for binary SVM with L1-soft margin.
%
% Synopsis:
% model = smo( data )
% model = smo( data, options )
% model
www.eeworm.com/read/244790/12843315
m skmeans.m
% MATLAB implementation of Sequential K-means using the SOMTOOLBOX
% Source:
% T. Kohonen (1997). Self-Organizing Maps, 2nd. Edition,
% Springer-Verlag.
%
% Code author: Guilherme A. Barr
www.eeworm.com/read/143592/12858953
cpp prg3_1.cpp
// File: prg3_1.cpp
// the program compares the efficiency of the sequential
// and binary search by timing algorithm execution using the
// timer class. two integer arrays list1 and list2
// of s
www.eeworm.com/read/330692/12874710
v mult16.v
// **** Here's a simple, sequential multiplier. Very simple, unsigned..
// Not very well tested, play with testbench, use at your own risk, blah blah blah..
//
//
// Unsigned 16-bit multiply (m