理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 Sampling相关记录48条 . 查询时间(0.068 秒)
This talk is concerned with a direct sampling method for imaging the support of a frequency-dependent source term embedded in a homogeneous and isotropic medium. The source term is given by the Fourie...
Adaptive computation is of great importance in numerical simulations. The ideas for adaptive computations can be dated back to adaptive finite element methods in 1970s. In this talk, we shall first re...
Consider a large scale sensor array having N sensors that monitors a surveillance area. Using all sensors simultaneously may be unreasonable in terms of power consumption and data processing.For examp...
Sampling and Estimation in Hidden Populations Using Respondent-Driven Sampling
Respondent-driven sampling (RDS) is a network-based method for sampling hidden and hard-to-reach populations that has been shown to produce asymptotically unbiased population estimates when its ass...
We consider the situation in semi-supervised learning, where the “label sampling” mechanism stochastically depends on the true response (as well as potentially on the features). We suggest a method of...
We propose a sketch-based sampling algorithm, which effectively exploits the data sparsity. Sampling methods have become popular in large-scale data mining and information retrieval, where high data s...
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the original CRS and exten...
We congratulate Gerber and Chopin for a very interesting paper with much promise for applications. SQMC is similar to array-RQMC (L'Ecuyer et al., 2008), in using T sets of N points in [0;1]d inste...
In multiple importance sampling we combine samples from a nite list of proposal distributions. When those proposal distributions are used to create control variates, it is possible (Owen and Zhou, ...
Other space- lling curves, such as those due to Sierpinski and Peano, also attain these rates, while upper bounds for the Lebesgue curve are somewhat worse, as if the dimension were log2 (3) times...
Monte Carlo methods are used to approximate the means, μ, of random variables Y, whose distributions are not known explicitly. The key idea is that the average of a random sample, Y1,...,Yn, tends t...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...