-
341
The Research on Improved Companding Transformation for Reducing PAPR in Underwater Acoustic OFDM Communication System
Published 2016-01-01“…However the companding transformation has far less computation complexity than SLM or PTS technologies and can improve the BER performance compared to the amplitude limiting technique simultaneously. …”
Get full text
Article -
342
Optimization Based High-Speed Railway Train Rescheduling with Speed Restriction
Published 2014-01-01“…There are three prominent features of the framework, such as realized interaction with dispatchers, emphasized passengers’ satisfaction, and reduced computation complexity with a bilayer modeling approach. The proposed rescheduling model is simulated on the busiest part of Beijing to Shanghai high-speed railway in China. …”
Get full text
Article -
343
Efficient Model Predictive Algorithms for Tracking of Periodic Signals
Published 2012-01-01“…The decomposition allows these two subproblems of very different computational complexities to be solved in parallel with different sampling rates. …”
Get full text
Article -
344
A Simplified Finite Control Set Model Predictive Control for T-Type Three-Level Power Conversion System Based on LCL Filter
Published 2021-01-01“…In order to overcome these issues, this paper proposes a simplified FCSMPC algorithm to reduce the computation complexity. Furthermore, full-dimensional state observers are adopted and implemented to estimate the instantaneous values of grid-side current and capacitor voltage for purpose of removing unnecessary electrical sensors. …”
Get full text
Article -
345
Multiobjective Synthesis of Linear Arrays by Using an Improved Genetic Algorithm
Published 2019-01-01“…To reduce the computation complexity, the repeat calculation of the fitness function in each generation is replaced by a precomputed discrete cosine transform matrix. …”
Get full text
Article -
346
Combination of MLFMA and ACA to Accelerate Computation of Scattering from Underground Targets
Published 2019-01-01“…Multilevel fast multipole algorithm (MLFMA) is used to decrease the computation complexity and memory cost. However, the octree used in MLFMA is not applied for rough surfaces and targets together; both the surface and target need to construct octree separately. …”
Get full text
Article -
347
Memristor-based feature learning for pattern classification
Published 2025-01-01“…However, since biological organs may operate differently from semiconductor devices, deep models usually require dedicated hardware and are computation-complex. High energy consumption has made deep model growth unsustainable. …”
Get full text
Article -
348
Efficient Iris Recognition Based on Optimal Subfeature Selection and Weighted Subregion Fusion
Published 2014-01-01“…The experimental results, on three public and renowned iris databases (CASIA-V3 Interval, Lamp, andMMU-V1), demonstrate that our proposed methods outperform some of the existing methods in terms of correct recognition rate, equal error rate, and computation complexity.…”
Get full text
Article -
349
Bi-GRU Enhanced Cost-Effective Memory-Aware End-to-End Learning for Geometric Constellation Shaping in Optical Coherent Communications
Published 2024-01-01“…Additionally, compared with the bi-directional long short-term memory (bi-LSTM) based GCS, the proposed bi-GRU scheme has lower computation complexity with similar system performance.…”
Get full text
Article -
350
Frequency Resource Sharing and Allocation Scheme Based on Coalition Formation Game in Hybrid D2D-Cellular Network
Published 2015-01-01“…Compared with the exhaustive search, our algorithm has much lower computer complexity. In addition, we prove that stability and convergence of the proposed algorithm using the concept of a defection function. …”
Get full text
Article -
351
A Novel Sparse Array for Localization of Mixed Near-Field and Far-Field Sources
Published 2021-01-01“…The largest consecutive lags and composition method of ESNA are also given, under a given number of sensors.Our algorithm has moderate computation complexity, which provides a higher resolution and improves the parameters’ estimation accuracy. …”
Get full text
Article -
352
FloorLoc-SL: Floor Localization System with Fingerprint Self-Learning Mechanism
Published 2015-11-01“…This algorithm is low computation complexity, which can be operated on any mobile phones. …”
Get full text
Article -
353
A Compact Representation for 3D Animation Using Octrees and Affine Transformations
Published 2010-01-01“…In fact, we demonstrate a computation complexity of Θ(𝑛2) for our method, while some of these methods can reach complexities of 𝑂(𝑛3) and worse. …”
Get full text
Article -
354
A Comparative Analysis of Fractional Space-Time Advection-Dispersion Equation via Semi-Analytical Methods
Published 2022-01-01“…Researchers use a variety of numerical techniques to study such fractional models, but the nonlocality of the derivative having fractional order leads to high computation complexity and complex calculations, so the task is to find an efficient technique that requires less computation and provides greater accuracy when numerically solving such models. …”
Get full text
Article -
355
Interference Mitigation Based on Low Complexity Subspace Tracking Method for Vehicle Positioning
Published 2022-01-01“…The proposed monitor is simple, efficient, and can decide when to start the interference mitigation procedure, which can reduce the computation complexity significantly; Subspace-based method is introduced to track the interference basis matrix that can be feed to RootMUSIC to detect the frequency of interference, followed by the interference mitigation with a notch filter. …”
Get full text
Article -
356
Sparse Deep Nonnegative Matrix Factorization
Published 2020-03-01“…We also analyzed the computing complexity of our frameworks to demonstrate their efficiency. …”
Get full text
Article -
357
A distributed scheme for energy-efficient event-based target recognition using Internet of Multimedia Things
Published 2022-05-01“…Some solutions presented in the literature, such as image compression, do not efficiently solve this problem because of the algorithms’ computational complexities. Thus, detecting the event of interest locally before the communication using shape-based descriptors would avoid useless data transmission and would extend the network lifetime. …”
Get full text
Article -
358
High Performance GPU-Based Fourier Volume Rendering
Published 2015-01-01“…As a result of its O(N2logN) time complexity, it provides a faster alternative to spatial domain volume rendering algorithms that are O(N3) computationally complex. Relying on the Fourier projection-slice theorem, this technique operates on the spectral representation of a 3D volume instead of processing its spatial representation to generate attenuation-only projections that look like X-ray radiographs. …”
Get full text
Article -
359
Effect of Physically Realistic Potential Energy Form on Spatial Pattern Complexity in a Collective Motion Model
Published 2023-01-01“…The particle model was simulated under a number of parameterizations of this generalized potential, and the average complexity of the spatial pattern produced by each was computed. Complexity was measured by tracking the information needed to describe the particle system at different scales (the complexity profile). …”
Get full text
Article -
360
Advanced Text Summarization Model Incorporating NLP Techniques and Feature-Based Scoring
Published 2025-01-01“…Moreover, although it is more computationally complex, it efficiently combines higher quality with faster summarization. …”
Get full text
Article