代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/346158/3189485
m qmr1.m
% Make a QMR-like network
% This is a bipartite graph, where the top layer contains hidden disease nodes,
% and the bottom later contains observed finding nodes.
% The diseases have Bernoulli CPDs, t
www.eeworm.com/read/334125/3373733
c finddcs.c
/*
Unix SMB/CIFS implementation.
a composite API for finding a DC and its name
Copyright (C) Volker Lendecke 2005
Copyright (C) Andrew Bartlett 2006
This pro
www.eeworm.com/read/325240/3485966
java addressbookdataaccess.java
// Fig. 8.34: AddressBookDataAccess.java
// Interface that specifies the methods for inserting,
// updating, deleting and finding records.
package com.deitel.advjhtp1.jdbc.addressbook;
// Java core p
www.eeworm.com/read/292984/3935725
m qmr1.m
% Make a QMR-like network
% This is a bipartite graph, where the top layer contains hidden disease nodes,
% and the bottom later contains observed finding nodes.
% The diseases have Bernoulli CPDs, t
www.eeworm.com/read/292964/3936873
m qmr1.m
% Make a QMR-like network
% This is a bipartite graph, where the top layer contains hidden disease nodes,
% and the bottom later contains observed finding nodes.
% The diseases have Bernoulli CPDs, t
www.eeworm.com/read/292144/3954832
erl xref_examples.erl
-module(xref_examples).
-export([script/0]).
%% Used at Erlang/OTP for finding undefined functions and unused local
%% functions. Output are the two files ${HOME}/undefined.txt and
%% ${HOME}/unused
www.eeworm.com/read/274903/4180305
h lyleaks.h
#ifndef __LYLEAKS_H
/*
* Avoid include redundancy
* Include only if finding memory leaks.
*/
#define __LYLEAKS_H
/*
** Copyright (c) 1994, University of Kansas, All Rights Reserved
**
** Include
www.eeworm.com/read/434858/1867921
m qmr1.m
% Make a QMR-like network
% This is a bipartite graph, where the top layer contains hidden disease nodes,
% and the bottom later contains observed finding nodes.
% The diseases have Bernoulli CPDs, t
www.eeworm.com/read/430037/1942802
m pr9_26.m
%Problem 9.26;
%finding free distance of convolutional codes;
clear all;
Go=[171;165;133]; %set matrix of generator polynomials in octal representation;
n=size(Go,1); %number of symbols in the f
www.eeworm.com/read/393163/2487820
m qmr1.m
% Make a QMR-like network
% This is a bipartite graph, where the top layer contains hidden disease nodes,
% and the bottom later contains observed finding nodes.
% The diseases have Bernoulli CPDs, t