搜索结果
找到约 119 项符合
maximum-likelihood 的查询结果
数学计算 Using Jacobi method and Gauss-Seidel iterative methods to solve the following system The require
Using Jacobi method and Gauss-Seidel iterative methods to solve the following system
The required precision is   =0.00001, and the maximum iteration number N=25. Compare the number of iterations and the convergence of these two methods
其他 The first task at hand is to set up the endpoints appropriately for this example. The following code
The first task at hand is to set up the endpoints appropriately for this example. The following code switches the CPU clock speed
to 48 MHz (since at power-on default it is 12 MHz), and sets up EP2 as a Bulk OUT endpoint, 4x buffered of size 512, and EP6
as a Bulk IN endpoint, also 4x buffered of si ...
单片机开发 // // Histogram Sample // This sample shows how to use the Sample Grabber filter for video image p
//
// Histogram Sample
// This sample shows how to use the Sample Grabber filter for video image processing.
// Conceptual background:
// A histogram is just a frequency count of every pixel value in the image.
// There are various well-known mathematical operations that you can perform on an image ...
matlab例程 In this demo, I use the EM algorithm with a Rauch-Tung-Striebel smoother and an M step, which I ve r
In this demo, I use the EM algorithm with a Rauch-Tung-Striebel smoother and an M step, which I ve recently derived, to train a two-layer perceptron, so as to classify medical data (kindly provided by Steve Roberts and Will Penny from EE, Imperial College). The data and simulations are described in: ...
数值算法/人工智能 北京大学ACM题 Here is a geometric problem. You have an angle and some squares in the first quadrant of
北京大学ACM题
Here is a geometric problem. You have an angle and some squares in the first quadrant of the plane rectangular coordinates. The vertex of the angle is fixed on the origin O of the coordinates, and both of its radial lines are specified by the input. The sizes of the squares are also s ...
数值算法/人工智能 北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the
北京大学ACM比赛题目
Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the ma ...
其他 Obtain the CDF plots of PAPR from an OFDM BPSK transmission specified per IEEE 802.11a specification
Obtain the CDF plots of PAPR from an OFDM BPSK transmission specified per IEEE 802.11a specification
Per the IEEE 802.11a specifications, we 52 have used subcarriers. Given so, the theoretical maximum expected PAPR is 52 (around 17dB). However, thanks to the scrambler, all the subcarriers in an OFDM ...
单片机开发 This LDPC software is intended as an introduction to LDPC codes computer based simulation. The pseud
This LDPC software is intended as an introduction to LDPC codes computer based simulation. The pseudo-random irregular low density parity check matrix is based on Radford M. Neal’s programs collection, which can be found in [1]. While Neal’s collection is well documented, in my opinion, C source c ...
其他书籍 Sequential Monte Carlo without Likelihoods 粒子滤波不用似然函数的情况下 本文摘要:Recent new methods in Bayesian simu
Sequential Monte Carlo without Likelihoods
粒子滤波不用似然函数的情况下
本文摘要:Recent new methods in Bayesian simulation have provided ways of evaluating posterior distributions
in the presence of analytically or computationally intractable likelihood functions.
Despite representing a substantial ...
matlab例程 This LDPC software is intended as an introduction to LDPC codes computer based simulation. The pseud
This LDPC software is intended as an introduction to LDPC codes computer based simulation. The pseudo-random irregular low density parity check matrix is based on Radford M. Neal’s programs collection, which can be found in [1]. While Neal’s collection is well documented, in my opinion, C source c ...