搜索结果: 1-15 共查到“知识库 概率分布”相关记录24条 . 查询时间(1.89 秒)
杂质纵向高斯分布UTBB-SOI MOSFET的虚拟阴极阈值电压解析模型
UTBB-SOIMOSFET 高斯分布 虚拟阴极 阈值电压
font style='font-size:12px;'>
2022/3/15
Distributed average consensus with least-mean-square deviation
Distributed average consensus Least-mean-square Convex optimization Edge-transitive graphs
font style='font-size:12px;'>
2015/8/10
We consider a stochastic model for distributed average consensus, which arises in applications such as load balancing for parallel processors, distributed coordination of mobile autonomous agents, and...
On the Permanents of Complements of the Direct Sum of identity Matrices
Complement, permanent magnet straight, identity matrix
font style='font-size:12px;'>
2015/7/14
On the Permanents of Complements of the Direct Sum of identity Matrices.
ON THE MAXIMUM DIFFERENCE BETWEEN THE EMPIRICAL AND EXPECTED HISTOGRAMS FOR SUMS
N independent distributed random variables curve Sn probability histogram
font style='font-size:12px;'>
2015/7/14
Suppose Sn
is a sum of n independent and identically
distributed random variables with E\Xl\
ON INCONSISTENT BAYES ESTIMATES IN THE DISCRETE CASE
Probability distribution integer mixture dirichlet
font style='font-size:12px;'>
2015/7/14
Consider sampling from an unknown probability distribution on the
integers. With a tail-free prior, the posterior distribution is consistent. With
a mixture of a tail-free prior and a point mass, ...
TESTING FOR INDEPENDENCE IN A TWO-WAY TABLE: NEW INTERPRETATIONS OF THE CHI-SQUARE STATISTIC
Classic chi-square distribution independent statistics dimension
font style='font-size:12px;'>
2015/7/14
The classical chi-square test for independence in a two-way contingency
table often rejects the independence hypothesis at an extremely small signif-
icance level, particularly when the sample siz...
针对机动目标跟踪问题, 基于转换时间条件交互多模型(STC-IMM) 结构, 提出一种转换概率自适应的STC-AIMM 算法. 该算法根据滤波器收敛时间预设了模型转换时间条件, 保证了滤波器对目标后验状态的合理逼近,同时通过模型转换概率的自适应算法实现了模型与目标运动模式的实时最优匹配. 理论和仿真分析结果表明:相比交互多模型(IMM) 算法和STC-IMM 算法, 该算法能够发挥滤波器最优性能,...
Computationally Efficient Modulation Level Classification Based on Probability Distribution Distance Functions
Computationally Efficient Modulation Level Classification Probability Distribution Distance Functions
font style='font-size:12px;'>
2011/2/25
We present a novel modulation level classification (MLC) method based on probability distribution distance functions.
On Arnold's and Kazhdan's equidistribution problems
Arnold's Kazhdan's equidistribution problems
font style='font-size:12px;'>
2010/12/13
We consider isometric actions of lattices in semisimple algebraic groups on (possibly non-compact) homogeneous spaces with (possibly infinite) invariant Radon measure. We assume that
the action has a...
Partial Match Queries in Two-Dimensional Quadtrees : a Probabilistic Approach
Quadtree Partial match query Fragmentation theory Markov chain Coupling
font style='font-size:12px;'>
2010/12/7
We analyze the mean cost of the partial match queries in random two-dimensional quadtrees. The method is based on fragmentation theory. The convergence is guaranteed by a coupling argument of Markov c...
Distribution of the systolic volume of homology classes
Systolic volume homology of a group with integer coefficients
font style='font-size:12px;'>
2010/12/6
Given a pair (G, a) where G is a finitely presentable group and a is an integer homology class of this group, Gromov defined in [Gro83] a new numerical invariant associated to this pair called systoli...
The distribution of height and diameter in random non-plane binary trees
distribution of height diameter in random non-plane binary trees
font style='font-size:12px;'>
2010/12/1
This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees (“Otter trees”), when trees of a given size are taken with equal likelihood. The height of...
Distributed Basis Pursuit
Basis pursuit distributed algorithms
font style='font-size:12px;'>
2010/11/30
Nowadays we are witnessing major changes both in the acquisition and representation of signals and in the computing platforms for their processing.
Fastest Distributed Consensus on Petal Networks
Fastest Distributed Consensus Petal Networks
font style='font-size:12px;'>
2010/12/13
Providing an analytical solution for the problem of finding Fastest Distributed Consensus (FDC) is one of the challenging problems in the field of sensor networks. Here in this work we present analyti...
A characterization of non-central Wishart distributions
non-central Wishart distribution Gindikin ensemble Wishart processes
font style='font-size:12px;'>
2010/11/29
This paper settles the existence issue of non-central Wishart distributions which is a research topic initiated byWishart (1928), and with important contributions by e.g., L´evy
(1937), Gindiki...