Results 1 to 10 of about 11,417,388 (340)
Fast algorithms for computing phylogenetic divergence time [PDF]
BMC Bioinformatics, 2017 Background The inference of species divergence time is a key step in most phylogenetic studies. Methods have been available for the last ten years to perform the inference, but the performance of the methods does not yet scale well to studies with ...
Ralph W. Crosby, Tiffani L. Williams
doaj +2 more sources
Convolution Accelerator Designs Using Fast Algorithms
Algorithms, 2019 Convolutional neural networks (CNNs) have achieved great success in image processing. However, the heavy computational burden it imposes makes it difficult for use in embedded applications that have limited power consumption and performance.
Yulin Zhao, Donghui Wang, Leiou Wang
doaj +2 more sources
Intrinsic Frequency Analysis and Fast Algorithms [PDF]
Scientific Reports, 2018 Intrinsic Frequency (IF) has recently been introduced as an ample signal processing method for analyzing carotid and aortic pulse pressure tracings. The IF method has also been introduced as an effective approach for the analysis of cardiovascular system
Peyman Tavallali +2 more
doaj +2 more sources
Fast algorithms for approximate circular string matching. [PDF]
Algorithms Mol Biol, 2014 Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n.
Barton C, Iliopoulos CS, Pissis SP.
europepmc +2 more sources
Proceedings of the Genetic and Evolutionary Computation Conference, 2017 For genetic algorithms (GAs) using a bit-string representation of length n, the general recommendation is to take 1/n as mutation rate. In this work, we discuss whether this is justified for multi-modal functions.
Benjamin Doerr +3 more
semanticscholar +3 more sources
Journal of Symbolic Computation, 2013 We give new simple algorithms for the fast computation of the quotient boot and the gcd of two polynomials, and obtain a complexity O(d(log"2d)^2), where d is the degree of the polynomials, similarly to Schonhage (1971), Moenck (1973). More precisely, denoting by M(d) the cost of a fast multiplication of polynomials of degree d, we reach the complexity
Marie-Françoise Roy
exaly +5 more sources
Приборы и методы измерений, 2021 The method of averaging modified periodograms is one of the main methods for estimating the power spectral density (PSD). The aim of this work was the development of mathematical and algorithmic support, which can increase the computational efficiency of
V. N. Yakimov
doaj +1 more source
Fast iterative algorithms for birefringent filter design [PDF]
Applied Computing and Informatics, 2021 Fast iterative algorithms for designing birefringent filters with any specified spectral response are proposed. From the Jones formalism, we derive two polynomials representing the transmitted and rejected response of the filter, respectively.
Abdelhak Boukharouba
doaj +1 more source
Моделирование и анализ информационных систем, 2023 The development of fast algorithms for key generation, encryption and decryption not only increases the efficiency of related operations. Such fast algorithms, for example, for asymmetric cryptosystems on quasi-cyclic codes, make it possible to ...
Andrey N. Sushko +4 more
doaj +1 more source
Nonlinearizad of Fast Fourier Transform
Цифровые модели и решения, 2023 A unified mathematical form of reversible nonlinear transformations based on a nonlinear tensor product is presented in the form of fast algorithms.
Valeriy Labunets +2 more
doaj +1 more source