代码搜索：Probabilistic
找到约 236 项符合「Probabilistic」的源代码
代码结果 236
www.eeworm.com/read/416320/11033241
c log_pearl.c
// ------------------------------------------------------------------------
// Name: log_pearl.c
// Created: February 21, 2000
//
// Iterative probabilistic decoding of linear block codes
// Bas
www.eeworm.com/read/295861/8136213
c llr_pearl_bp.c
// ------------------------------------------------------------------------
// Name: llr_pearl.c
// Created: February 21, 2000
//
// Iterative probabilistic decoding of linear block codes
// Bas
www.eeworm.com/read/295861/8136250
c log_pearl_bp.c
// ------------------------------------------------------------------------
// Name: log_pearl.c
// Created: February 21, 2000
//
// Iterative probabilistic decoding of linear block codes
// Bas
www.eeworm.com/read/227632/14419129
cpp ldpc解码程序ldpc_robert_org.cpp
// ------------------------------------------------------------------------
// Name: llr_pearl.c
// Created: February 21, 2000
//
// Iterative probabilistic decoding of linear block codes
// Bas
www.eeworm.com/read/314474/13566800
cc vocabmultimap.cc
/*
* VocabMultiMap.cc --
* Probabilistic mappings between a vocabulary and strings from
* another vocabulary (as in dictionaries).
*
*/
#ifndef lint
static char Copyright[] = "Copyright
www.eeworm.com/read/182374/9205802
m intfda.m
function[NewPop]=IntFDA(Cliques,SelPop,NumbVar,N,Card)
% IntFDA contains the learning and sampling steps of the RunFDA
% The structure of the probabilistic model is given
% INPUTS
%
www.eeworm.com/read/182374/9205819
m intfda.m
function[NewPop]=IntFDA(Cliques,SelPop,NumbVar,N,Card)
% IntFDA contains the learning and sampling steps of the RunFDA
% The structure of the probabilistic model is given
% INPUTS
%
www.eeworm.com/read/182374/9205855
m intfda.m
function[NewPop]=IntFDA(Cliques,SelPop,NumbVar,N,Card)
% IntFDA contains the learning and sampling steps of the RunFDA
% The structure of the probabilistic model is given
% INPUTS
%
www.eeworm.com/read/154345/11969491
h skiplist.h
/*
SKIPLIST.H
DESCRIPTION:
Interface for skip list
See William Pugh's paper:
Skip Lists: A Probabilistic Alternative to Balanced Trees
This is a goo
www.eeworm.com/read/241991/4557064
readme
Probabilistic Broadcast for JavaGroups
======================================
JavaGroups currently uses virtual synchrony (VS) in its main protocol
suite. VS is suited for tightly coupled, l