Results 61 to 70 of about 643,547 (199)

Running applications on a hybrid cluster [PDF]

Компьютерные исследования и моделирование, 2015
A hybrid cluster implies the use of computational devices with radically different architectures. Usually, these are conventional CPU architecture (e.g. x86_64) and GPU architecture (e. g. NVIDIA CUDA).
A. V. Bogdanov, I. G. Gankevich, V. Yu. Gayduchok, N. V. Yuzhanin   +3 more
doaj   +1 more source

Two Dimensional Harmonics Retrieval in Zero-Mean Independent Multiplicative and Additive Noises

ITM Web of Conferences, 2016
For some theoretical problems and computational inefficiency, the problem of estimating the frequencies of two dimensional harmonics in zero-mean independent multiplicative and additive noises is not resolved completely.
Zhang Zheng-Wei, Chen Zhong, Wang Li-Hui
doaj   +1 more source

A Covariance-Free Strictly Complex-Valued Relevance Vector Machine for Reducing the Order of Linear Time-Invariant Systems

Mathematics
Multiple-input multiple-output (MIMO) linear time-invariant (LTI) systems exhibit enormous computational costs for high-dimensional problems. To address this problem, we propose a novel approach for reducing the dimensionality of MIMO systems. The method
Weixiang Xie, Jie Song
doaj   +1 more source

Crossing over...Markov meets Mendel. [PDF]

PLoS Computational Biology, 2012
Chromosomal crossover is a biological mechanism to combine parental traits. It is perhaps the first mechanism ever taught in any introductory biology class.
Saad Mneimneh
doaj   +1 more source

Graphics Processing Units and High-Dimensional Optimization

, 2010
This paper discusses the potential of graphics processing units (GPUs) in high-dimensional optimization problems. A single GPU card with hundreds of arithmetic cores can be inserted in a personal computer and dramatically accelerates many statistical ...
Lange, Kenneth, Suchard, Marc A., Zhou, Hua   +2 more
core   +1 more source

Bayesian computational methods

, 2010
In this chapter, we will first present the most standard computational challenges met in Bayesian Statistics, focussing primarily on mixture estimation and on model choice issues, and then relate these problems with computational solutions.
Robert, Christian P.
core   +1 more source

Organization mechanism and counting algorithm on Vertex-Cover solutions

, 2015
Counting the solution number of combinational optimization problems is an important topic in the study of computational complexity, especially on the #P-complete complexity class.
Guo, Binghui, Niu, Baolong, Wei, Wei, Zhang, Renquan, Zheng, Zhiming   +4 more
core   +1 more source

Unbiased and efficient log-likelihood estimation with inverse binomial sampling.

PLoS Computational Biology, 2020
The fate of scientific hypotheses often relies on the ability of a computational model to explain the data, quantified in modern statistical approaches by the likelihood function.
Bas van Opheusden, Luigi Acerbi, Wei Ji Ma   +2 more
doaj   +1 more source

Computational Bayesian Methods Applied to Complex Problems in Bio and Astro Statistics [PDF]

In this dissertation we apply computational Bayesian methods to three distinct problems. In the first chapter, we address the issue of unrealistic covariance matrices used to estimate collision probabilities.
Elrod, Chris, Hejduk, Matthew D., Stamey, James A.   +2 more
core   +1 more source

Bayesian computational methods [PDF]

, 2004
If, in the mid 1980?s, one had asked the average statistician about the difficulties of using Bayesian Statistics, his/her most likely answer would have been ?Well, there is this problem of selecting a prior distribution and then, even if one agrees on ...
Robert, Christian P.
core