代码搜索:JTree

找到约 1,656 项符合「JTree」的源代码

代码结果 1,656
www.eeworm.com/read/133943/5897269

m bp1.m

% Compare different loopy belief propagation algorithms on a graph with a single loop. % LBP should give exact results if it converges. seed = 0; rand('state', seed); randn('state', seed); N = 2; da
www.eeworm.com/read/133943/5897312

m fg2.m

% make a factor graph corresponding to an HMM, where we absorb the evidence up front, % and then eliminate the observed nodes. % Compare this with not absorbing the evidence. seed = 1; rand('state',
www.eeworm.com/read/133943/5897624

m backt.m

function b = backT(engine, f, t) if t==1 [b.clpot, seppot] = distribute_evidence(engine.jtree_engine1, f.clpot, f.seppot); else [b.clpot, seppot] = distribute_evidence(engine.jtree_engine, f.clpo
www.eeworm.com/read/133943/5897636

m backt.m

function b = backT(engine, f, t) if t==1 [b.clpot, seppot] = distribute_evidence(engine.jtree_engine1, f.clpot, f.seppot); else [b.clpot, seppot] = distribute_evidence(engine.jtree_engine, f
www.eeworm.com/read/160391/5571123

m bp1.m

% Compare different loopy belief propagation algorithms on a graph with a single loop. % LBP should give exact results if it converges. seed = 0; rand('state', seed); randn('state', seed); N
www.eeworm.com/read/160391/5571168

m fg2.m

% make a factor graph corresponding to an HMM, where we absorb the evidence up front, % and then eliminate the observed nodes. % Compare this with not absorbing the evidence. seed = 1; rand('st
www.eeworm.com/read/160391/5571487

m backt.m

function b = backT(engine, f, t) if t==1 [b.clpot, seppot] = distribute_evidence(engine.jtree_engine1, f.clpot, f.seppot); else [b.clpot, seppot] = distribute_evidence(engine.jtree_engine, f
www.eeworm.com/read/160391/5571499

m backt.m

function b = backT(engine, f, t) if t==1 [b.clpot, seppot] = distribute_evidence(engine.jtree_engine1, f.clpot, f.seppot); else [b.clpot, seppot] = distribute_evidence(engine.jtree_engine, f
www.eeworm.com/read/140847/5779151

m gaussian2.m

% Make the following network (from Jensen (1996) p84 fig 4.17) % 1 % / | \ % 2 3 4 % | | | % 5 6 7 % \/ \/ % 8 9 % where all arcs point downwards N = 9; dag = zeros(N,N);
www.eeworm.com/read/140847/5779445

m backt_mpe.m

function [b, mpe] = backT_mpe(engine, f, ev2, t) bnet = bnet_from_engine(engine); ss = bnet.nnodes_per_slice; if t==1 % ev2 is just the evidence on slice 1 [mpe, b.clpot] = find_max_confi