Suchergebnisse - stochastic divide and conquer algorithms

On the analysis of stochastic divide and conquer algorithms von Rösler, U.

Volltext

On the analysis of stochastic divide and conquer algorithms: Average-Case Analysis of Algorithms von RÖSLER, U

Volltext

Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication von Roy, Sandipan, Atchadé, Yves, Michailidis, George

“… We consider a stochastic blockmodel equipped with node covariate information, that is, helpful in analyzing social network data …”
Volltext

Iterative stochastic subspace self-consistent field method von Loos, Pierre-François, Rivail, Jean-Louis, Assfeld, Xavier

“… We propose a new self-consistent field (SCF) algorithm based on an iterative, partially stochastic “Divide & Conquer” -type approach …”
Volltext

On Kemeny's constant and stochastic complement von Bini, Dario Andrea, Durastante, Fabio, Kim, Sooyeong, Meini, Beatrice

“… Bounds to Kemeny's constant of perturbed matrices are given. Relying on these theoretical results, a divide-and-conquer algorithm for the efficient computation of Kemeny's constant of graphs is designed …”
Volltext

Asymptotic distributions for Random Median Quicksort von Okasha, H.M., Rösler, U.

“… The first complete running time analysis of a stochastic divide and conquer algorithm was given for Quicksort, a sorting algorithm invented 1961 by Hoare …”
Volltext

Likelihood Inference for Large Scale Stochastic Blockmodels with Covariates based on a Divide-and-Conquer Parallelizable Algorithm with Communication von Roy, Sandipan, Atchadé, Yves, Michailidis, George

“… We consider a stochastic blockmodel equipped with node covariate information, that is helpful in analyzing social network data …”
Volltext

Divide-and-Conquer Information-Based Optimal Subdata Selection Algorithm von Wang, HaiYing

“… This paper develops a divide-and-conquer IBOSS approach to solving this problem, in which the full data set is divided into smaller partitions to be loaded into the memory and then subsets of data …”
Volltext

Fixed points of the smoothing transform: two-sided solutions von Alsmeyer, Gerold, Meiners, Matthias

“… random variables independent of ( C , T ) and with distribution P . We study the fixed points of the smoothing transform, that is, the solutions to the stochastic fixed-point equation …”
Volltext

Two provably consistent divide-and-conquer clustering algorithms for large networks von Mukherjee, Soumendu Sundar, Sarkar, Purnamrita, Bickel, Peter J

“… In this article, we advance divide-and-conquer strategies for solving the community detection problem in networks …”
Weitere Angaben

A hierarchical exact accelerated stochastic simulation algorithm von Orendorff, David, Mjolsness, Eric

“… A new algorithm, "HiER-leap" (hierarchical exact reaction-leaping), is derived which improves on the computational properties of the ER-leap algorithm for exact accelerated simulation of stochastic chemical kinetics …”
Weitere Angaben

Divide and conquer algorithm for nondiffracting beams von Martínez-Herrera, Alberto F, Céspedes-Mota, Armando, Lopez-Aguayo, Servando

“… The procedure reported is based on a stochastic direct search and global optimization: the differential evolution method …”
Weitere Angaben

Random sampling of contingency tables via probabilistic divide-and-conquer von DeSalvo, Stephen, Zhao, James

“… We present a new approach for random sampling of contingency tables of any size and constraints based on a recently introduced probabilistic divide-and-conquer (PDC) technique …”
Volltext

Low-rank updates and divide-and-conquer methods for quadratic matrix equations von Kressner, Daniel, Kürschner, Patrick, Massei, Stefano

“… Based on this procedure, we develop a divide-and-conquer method for quadratic matrix equations with coefficients that feature a specific type of hierarchical low-rank structure, which includes banded matrices …”
Volltext

Risk-averse two-stage stochastic programming for assembly line reconfiguration with dynamic lot sizes von Li, Yuchen, Liu, Ming, Saldanha-da-Gama, Francisco, Yang, Zaoli

“… To model the problem, a stochastic program with two stages is utilized. A solution approach is devised using a divide-and-conquer algorithm, which incorporates a set of valid inequalities …”
Volltext

A Decomposition-Based Hybrid Algorithm for Large-Scale Project Portfolio Selection and Scheduling With Reaction to Changing Environments von Liu, Jing, Sarker, Ruhul, Essam, Daryl, Elsayed, Saber

“… This article proposes a decomposition-based hybrid algorithm with evolutionary algorithm-based global search and exact solver-based local search to optimize large-scale PPSSP, and integrates …”
Volltext

Spectral clustering for divide-and-conquer graph matching von Lyzinski, Vince, Sussman, Daniel L., Fishkind, Donniell E., Pao, Henry, Chen, Li, Vogelstein, Joshua T., Park, Youngser, Priebe, Carey E.

“… •We present a novel divide-and-conquer bijective graph matching algorithm.•The algorithm is fully parallelizable, and scales to match “big data” graphs …”
Volltext

A divide‐and‐conquer algorithm for core‐periphery identification in large networks von Yanchenko, Eric

“… ‐and‐conquer algorithm to identify the core‐periphery structure in large networks. By finding this structure on much smaller sub …”
Volltext

A posteriori initial imperfection identification in shell buckling problems von Stull, Christopher J., Earls, Christopher J., Aquino, Wilkins

“… The current research seeks to demonstrate that an inverse solution approach, leveraging nonlinear finite element analysis with a divide and conquer type stochastic search algorithm, can identify …”
Volltext

A divide-and-conquer stochastic alterable direction image denoising method von Feng, Xiang-chu, Luo, Liang, Jia, Xi-xi, Wang, Wei-wei

“… A novel image denoising method based on stochastic technique is proposed in this paper …”
Volltext