代码搜索:Inference

找到约 1,820 项符合「Inference」的源代码

代码结果 1,820
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/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/160391/5571193

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/5779172

m bat1.m

% Compare the speeds of various inference engines on the BAT DBN [bnet, names] = mk_bat_dbn; T = 3; % fixed length sequence - we make it short just for speed USEC = exist('@jtree_C_inf_engine/collec
www.eeworm.com/read/133943/5897334

m discrete1.m

% Compare various inference engines on 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;
www.eeworm.com/read/133943/5897356

m bat1.m

% Compare the speeds of various inference engines on the BAT DBN [bnet, names] = mk_bat_dbn; T = 3; % fixed length sequence - we make it short just for speed USEC = exist('@jtree_C_inf_engine/collec
www.eeworm.com/read/160391/5571216

m bat1.m

% Compare the speeds of various inference engines on the BAT DBN [bnet, names] = mk_bat_dbn; T = 3; % fixed length sequence - we make it short just for speed USEC = exist('@jtree_C_inf_engine/c
www.eeworm.com/read/140847/5779081

m belprop_polytree_cg.m

% Inference on a conditional Gaussian model % Make the following polytree, where all arcs point down % 1 2 % \ / % 3 % / \ % 4 5 N = 5; dag = zeros(N,N); dag(1,3) = 1; dag(2,3)
www.eeworm.com/read/133943/5897267

m belprop_polytree_cg.m

% Inference on a conditional Gaussian model % Make the following polytree, where all arcs point down % 1 2 % \ / % 3 % / \ % 4 5 N = 5; dag = zeros(N,N); dag(1,3) = 1; dag(2,3)
www.eeworm.com/read/160391/5571121

m belprop_polytree_cg.m

% Inference on a conditional Gaussian model % Make the following polytree, where all arcs point down % 1 2 % \ / % 3 % / \ % 4 5 N = 5; dag = zeros(N,N); dag(1,3) = 1; dag(2,3)