代码搜索：Multinomial
找到约 224 项符合「Multinomial」的源代码
代码结果 224
www.eeworm.com/read/13871/284240
m multinomial_prob.m
function B = eval_pdf_cond_multinomial(data, obsmat)
% EVAL_PDF_COND_MULTINOMIAL Evaluate pdf of conditional multinomial
% function B = eval_pdf_cond_multinomial(data, obsmat)
%
% Notation: Y = o
www.eeworm.com/read/13871/284257
m multinomial_sample.m
function Y = sample_cond_multinomial(X, M)
% SAMPLE_MULTINOMIAL Sample Y(i) ~ M(X(i), :)
% function Y = sample_multinomial(X, M)
%
% X(i) = i'th sample
% M(i,j) = P(Y=j | X=i) = noisy channel mod
www.eeworm.com/read/392854/8322437
m multinomial_prob.m
function B = eval_pdf_cond_multinomial(data, obsmat)
% EVAL_PDF_COND_MULTINOMIAL Evaluate pdf of conditional multinomial
% function B = eval_pdf_cond_multinomial(data, obsmat)
%
% Notation: Y = obser
www.eeworm.com/read/392854/8322484
m multinomial_sample.m
function Y = sample_cond_multinomial(X, M)
% SAMPLE_MULTINOMIAL Sample Y(i) ~ M(X(i), :)
% function Y = sample_multinomial(X, M)
%
% X(i) = i'th sample
% M(i,j) = P(Y=j | X=i) = noisy channel model
%
www.eeworm.com/read/147186/12578495
m multinomial_prob.m
function B = eval_pdf_cond_multinomial(data, obsmat)
% EVAL_PDF_COND_MULTINOMIAL Evaluate pdf of conditional multinomial
% function B = eval_pdf_cond_multinomial(data, obsmat)
%
% Notation: Y = o
www.eeworm.com/read/147186/12578562
m multinomial_sample.m
function Y = sample_cond_multinomial(X, M)
% SAMPLE_MULTINOMIAL Sample Y(i) ~ M(X(i), :)
% function Y = sample_multinomial(X, M)
%
% X(i) = i'th sample
% M(i,j) = P(Y=j | X=i) = noisy channel mod
www.eeworm.com/read/152629/5672756
java naivebayestrainer.java
/* Copyright (C) 2002 Univ. of Massachusetts Amherst, Computer Science Dept.
This file is part of "MALLET" (MAchine Learning for LanguagE Toolkit).
http://www.cs.umass.edu/~mccallum/mallet
Th
www.eeworm.com/read/346712/11729723
java specialfunctions.java
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either vers
www.eeworm.com/read/272894/10937139
dpr ex.dpr
{
Solution 1:
F(n,h) is the amount of the state with n blocks, which the blocks in the last column aren't more than h.
F(n,h)=F(n,h-1)+F(n-h,h-1)
There is two selections for f(n,h).
One is s