Results 11 to 20 of about 36,225 (338)
A divide-and-conquer algorithm for quantum state preparation [PDF]
Scientific Reports, 2021 Advantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups.
Israel F. Araujo +3 more
doaj +4 more sources
Divide-and-Conquer Information-Based Optimal Subdata Selection Algorithm [PDF]
Journal of Statistical Theory and Practice, 2019 The information-based optimal subdata selection (IBOSS) is a computationally efficient method to select informative data points from large data sets through processing full data by columns. However, when the volume of a data set is too large to be processed in the available memory of a machine, it is infeasible to implement the IBOSS procedure.
HaiYing Wang
openalex +4 more sources
Supporting divide-and-conquer algorithms for image processing [PDF]
Journal of Parallel and Distributed Computing, 1987 Abstract Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing. For higher-level, symbolic operations it should often be the strategy of choice for parallel computers. It is natural for a machine with a regular interconnection scheme such as a mesh, mesh with broadcasting, tree, pyramid, mesh-of-trees ...
Quentin F. Stout
openalex +4 more sources
Computing Puiseux series: a fast divide and conquer algorithm [PDF]
Annales Henri Lebesgue, 2021 Let Fāš[X,Y] be a polynomial of total degree D defined over a perfect field š of characteristic zero or greater than D. Assuming F separable with respect to Y, we provide an algorithm that computes all singular parts of Puiseux series of F above X=0 in an expected Ć Ė(DĪ“ ) operations in š, where Ī“ is the valuation of the resultant of F and its ...
Poteaux, Adrien, Weimann, Martin
openaire +4 more sources
Quartets MaxCut: A Divide and Conquer Quartets Algorithm [PDF]
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2010 Accurate phylogenetic reconstruction methods are currently limited to a maximum of few dozens of taxa. Supertree methods construct a large tree over a large set of taxa, from a set of small trees over overlapping subsets of the complete taxa set. Hence, in order to construct the tree of life over a million and a half different species, the use of a ...
Sagi, Snir, Satish, Rao
openaire +2 more sources
Backtracking Reconstruction Network for Three-Dimensional Compressed Hyperspectral Imaging
Remote Sensing, 2022 Compressed sensing (CS) has been widely used in hyperspectral (HS) imaging to obtain hyperspectral data at a sub-Nyquist sampling rate, lifting the efficiency of data acquisition.
Xi Wang +5 more
doaj +1 more source
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic [PDF]
, 2011 We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for composition of power series, showing that it can be applied practically to composition of polynomials in Z[x] given in the standard monomial basis. We offer a complexity analysis,
Hart, William, Novocin, Andrew
openaire +3 more sources
Efficient Square-Based Montgomery Multiplier for All Type C.1 Pentanomials
IEEE Access, 2018 In this paper, we present a low complexity bit-parallel Montgomery multiplier for $GF(2^{m})$ generated with irreducible Type C.1 pentanomials $x^{m}+x^{m-1}+x^{k}+x+1$ . Based on a combination of generalized polynomial basis (GPB) squarer and a newly
Yin Li, Xingpo Ma, Qing Chen, Chuanda Qi
doaj +1 more source
A review of distributed statistical inference
Statistical Theory and Related Fields, 2022 The rapid emergence of massive datasets in various fields poses a serious challenge to traditional statistical methods. Meanwhile, it provides opportunities for researchers to develop novel algorithms.
Yuan Gao +5 more
doaj +1 more source
Sequential and Parallel Tools for Model Checking Conditional Stable Properties in a Layered Way
IEEE Access, 2022 We invented a divide & conquer approach to conditional stable model checking so as to ease the state space explosion problem. As indicated by its name, the technique concentrates on conditional stable properties expressed as $\varphi _{1 ...
Canh Minh Do, Yati Phyo, Kazuhiro Ogata
doaj +1 more source