代码搜索:finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/319883/13440298
cpp prog3_02.cpp
// Program 3.2 Finding the sizes of data types
#include
using std::cout;
using std::endl;
int main() {
// Output the sizes for integer types
cout
www.eeworm.com/read/319567/13448674
m costfuncmad.m
% Computes the Mean Absolute Difference (MAD) for the given two blocks
% Input
% currentBlk : The block for which we are finding the MAD
% refBlk : the block w.r.t. which the MAD is being
www.eeworm.com/read/141295/5774034
java systemclassloader.java
// SystemClassLoader.java -- the class loader that the system uses for finding
// classes at runtime.
package toba.runtime;
import toba.classfile.*;
import java.util.*;
i
www.eeworm.com/read/493005/6403860
cal pix.cal
/*
* pix - iterative method of finding the number of primes less than x
*
* Copyright (C) 1999 Landon Curt Noll
*
* Calc is open software; you can redistribute it and/or modify it under
* the t
www.eeworm.com/read/490082/6458166
m oneptrlx.m
% Demonstration of Gauss-Seidel (One Point Iteration) Root Finding
%
% The function is defined in the file 'fcn.m'. The contents of this file are:
%
% function y = fcn(x)
% y = -1200/(x
www.eeworm.com/read/485103/6564298
m missmult.m
function [X]=missmult(A,B)
%MISSMULT product of two matrices containing NaNs
%
%[X]=missmult(A,B)
%This function determines the product of two matrices containing NaNs
%by finding X according t
www.eeworm.com/read/409837/11310746
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/253931/12177000
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/339051/12265520
c stktrace.c
/* This file contains code to print function/arg stack tracebacks
* at run time, which is extremely useful for finding heap free() errors.
*
* This code is highly specific to Borland C and the 8
www.eeworm.com/read/338928/12271442
java samplingndi.java
//package datamining;
import java.io.*;
import java.util.*;
/**
* Class for finding frequent itemsets using sampling
* with the NDI algorithm.
*
* @author Michael Holler
* @version 0