代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/168406/9917786
m empder_search.m
function [Jopt,Wopt,OptDetails] = empder_search(contrast,x,W,kparam,optparam)
% EMPDER_SEARCH - Steepest descent method for finding a minima in the
% Stiefel manifold of orthogonal m
www.eeworm.com/read/166778/9999164
m4 warning.m4
# Finding valid warning flags for the C Compiler. -*-Autoconf-*-
#
# Copyright (C) 2001, 2002 Free Software Foundation, Inc.
#
# This program is free software; you can redistribute it and/or
www.eeworm.com/read/163245/10168991
m empder_search.m
function [Jopt,Wopt,OptDetails] = empder_search(contrast,x,W,kparam,optparam)
% EMPDER_SEARCH - Steepest descent method for finding a minima in the
% Stiefel manifold of orthogonal m
www.eeworm.com/read/359005/10171913
m subclust.m
function [centers,sigmas] = subclust(X,radii,xBounds,options)
%SUBCLUST Locates data cluster centers using subtractive clustering.
%
% SUBCLUST operates by finding the optimal data point to defin
www.eeworm.com/read/425020/10387486
txt ii-04-2.txt
(WA) The Old Canada Road is a long-lost trail between the Canadian province of Quebec and Maine, in the northeast corner of the United States. Yes, it really was lost, and finding it again was a compl
www.eeworm.com/read/159921/10588575
m fishdemo.m
function []=fishdemo(action,hfigure,varargin)
% FISHDEMO demo on algorithms which learn Fisher's classifer.
%
% FISHDEMO demonstrates use of algorithms finding the Fisher's
% classifier. The task is
www.eeworm.com/read/421949/10677265
m fishdemo.m
function []=fishdemo(action,hfigure,varargin)
% FISHDEMO demo on algorithms which learn Fisher's classifer.
%
% FISHDEMO demonstrates use of algorithms finding the Fisher's
% classifier. The task is
www.eeworm.com/read/420771/10776796
txt samplewithndi.txt
package datamining;
import java.io.*;
import java.util.*;
/**
* Class for finding frequent itemsets using sampling
* with the NDI algorithm.
*
* @author Michael Holler
* @version 0.1
www.eeworm.com/read/420767/10776863
txt partition with nid.txt
package datamining;
import java.io.*;
import java.util.*;
/**
* Class for implementing partition algorithm for
* finding non-derivable frequent itemsets.
*
* @author Michael Holler
*
www.eeworm.com/read/465386/7054553
txt 2.txt
Description The function The LMFnlsq.m serves for finding optimal solution of an overdetermined system of nonlinear equations in the least-squares sense. The standard Levenberg- Marquardt algorithm wa