Results 61 to 70 of about 57,732 (152)
Defining Asymptotic Parallel Time Complexity of Data-dependent Algorithms [PDF]
, 2014 The scientific research community has reached a stage of maturity where its strong need for high-performance computing has diffused into also everyday life of engineering and industry algorithms.
Fritzsche, Paula Cecilia +2 more
core +1 more source
Estimating Tail Probabilities of Random Sums of Phase-Type Scale Mixture Random Variables
, 2022 We consider the problem of estimating tail probabilities of random sums of scale mixture of phase-type distributions—a class of distributions corresponding to random variables which can be represented as a product of a non-negative but otherwise ...
Thomas Taimre, Hui Yao
core +1 more source
Efficient Analysis of Time-Varying Multicomponent Signals with Modified LPTFT
EURASIP Journal on Advances in Signal Processing, 2005 This paper presents efficient algorithms for the analysis of nonstationary multicomponent signals based on modified local polynomial time-frequency transform.
Wei Yongmei, Bi Guoan
doaj +1 more source
PhotonicsWith the explosive growth of global data traffic, long-distance fiber optic transmission systems are continuously evolving towards higher capacity and longer distances. However, to overcome the high complexity of fiber dispersion compensation algorithms,
Ying Wu +3 more
doaj +1 more source
A Low-Complexity Subcarrier-Power Allocation Scheme for Frequency-Division Multiple-Access Systems
, 2010 This letter aims to design a low-complexity subcarrier-power allocation scheme to improve the communication reliability of various types of frequency-division multiple-access (FDMA) systems. Both uplink and downlink are considered.
Yang, Lie-Liang +2 more
core +1 more source
Reduced complexity decoding algorithms for low-density parity check codes and turbo codes [PDF]
, 2003 Iterative decoding techniques have been receiving more and more attentions with the invention of turbo codes and the rediscovery of low-density parity-check (LDPC) codes.
Chen, Jinghu
core +1 more source
Cyclic-by-row approximation of iterative polynomial EVD algorithms [PDF]
, 2014 A recent class of sequential matrix diagonalisation (SMD) algorithms have been demonstrated to provide a fast converging solution to iteratively approximating the polynomial eigenvalue decomposition of a parahermitian matrix.
Weiss, Stephan +4 more
core +2 more sources
IEEE Access, 2019 Based on a heuristic optimization algorithm, this paper proposes a new algorithm named trajectory-planning beetle swarm optimization (TPBSO) algorithm for solving trajectory planning of robots, especially robot manipulators.
Lei Wang +4 more
doaj +1 more source
New Two-Stage Automorphism Group Decoders for Cyclic Codes
IEEE Access, 2020 Recently, error correcting codes in the erasure channel have drawn great attention for various applications such as distributed storage systems and wireless sensor networks, but many of their decoding algorithms are not practical because they have higher
Chanki Kim, Jong-Seon No
doaj +1 more source