Quantum complexity of time evolution with chaotic Hamiltonians by Vijay Balasubramanian, Matthew DeCross, Arjun Kar, Onkar Parrikar

“…Our analysis relates complexity to familiar properties of physical theories like their spectra and the structure of energy eigenstates and has implications for the hypothesized computational complexity class separations PSPACE BQP/poly and PSPACE BQSUBEXP/subexp, and the “fast-forwarding” of quantum Hamiltonians.…”
Get full text

Verifiable computation scheme of batch matrix multiplication based on triple perturbation and linear combination by ZHANG Tianpeng, REN Zhiyu, DU Xuehui, WANG Haichao

“…Meanwhile,the existing scheme is also not ideal for the verification efficiency of cloud server computing results.Aiming at the challenge of data privacy protection, the designed batch matrix multiplication verifiable computation scheme uses triple perturbation encryption algorithm to achieve stronger privacy protection without increasing the computational complexity of encryption and decryption. Specifically, a special upper or lower triangular sparse matrix is constructed to add double perturbation (multiplicative perturbation and additive perturbation) to protect row or column data, and a special additive sparse matrix is constructed to add a single perturbation (additive perturbation) to protect zero element information. …”
Get full text

Multiaircraft Optimal 4D Trajectory Planning Using Logical Constraints by Dinesh B. Seenivasan, Alberto Olivares, Ernesto Staffetti

“…In this way, the optimal control problem with logical constraints is converted into a smooth optimal control problem which is solved using traditional techniques, thereby reducing the computational complexity of finding the solution. The effectiveness of the approach is demonstrated through several numerical experiments by computing the optimal trajectories of multiple aircraft in converging and intersecting arrival routes with time-based separation constraints, distance-based separation constraints, and operational constraints.…”
Get full text

A Multistage Decision-Feedback Receiver Design for LTE Uplink in Mobile Time-Variant Environments by Juinn-Horng Deng, Shu-Min Liao

“…Instead of using a conventional equalizer, this work uses a group frequency-domain equalizer (GFDE) to reduce computational complexity. Furthermore, this work utilizes a dual iterative structure of group parallel interference cancellation (GPIC) and frequency-domain group parallel interference cancellation (FPIC) to mitigate the ICI effect. …”
Get full text

Compressive SAR Imaging Based on Modified Low-Rank and Sparse Decomposition by Jeong-Il Byeon, Wookyung Lee, Jihoon Choi

“…Numerical simulations using SAR modeling data validate the convergence of the proposed method and compare its computational complexity with baseline CS-SAR imaging schemes. …”
Get full text

Complexity Analysis of New Future Video Coding (FVC) Standard Technology by Soulef Bouaafia, Randa Khemiri, Seifeddine Messaoud, Fatma Elzahra Sayadi

“…Second, a fast FVC mode decision is proposed to reduce encoding computational complexity. Then, a comparison between three configurations, namely, Random Access, Low-Delay B, and Low-Delay P, is proposed, in terms of Bitrate, PSNR, and encoding time. …”
Get full text

3D Face Modeling Algorithm for Film and Television Animation Based on Lightweight Convolutional Neural Network by Cheng Di, Jing Peng, Yihua Di, Siwei Wu

“…The algorithm uses the difference criterion instead of the entropy criterion to avoid the “small sample” problem, and the use of QR decomposition can extract more effective discriminative features for facial recognition, while also reducing the computational complexity of feature extraction. Compared with traditional feature extraction methods, GMMSD avoids the problem of “small samples” and does not require preprocessing steps on the samples; it uses QR decomposition to extract features from the original samples and retains the distribution characteristics of the original samples. …”
Get full text

A Numerical Integration Method for Calculating the Bit Error Rate of Time-Modulated Array by Kexin Wang, Jian Zhang, Gang Xin, Xue Lei, Jun Gao, Tianpeng Li

“…The findings demonstrate consistency between the two methods while significantly reducing computational complexity.…”
Get full text

Detecting respiratory diseases using machine learning-based pattern recognition on spirometry data by Ahmed I. Taloba, R.T. Matoog

“…Due to issues with dimensionality and computational complexity, the relevant features are selected using Forward Feature Selection (FFS). …”
Get full text

Adaptive Filtering for Channel Estimation in RIS-Assisted mmWave Systems by Shuying Shao, Tiejun Lv, Pingmu Huang

“…Our analysis also reveals that both algorithms have lower computational complexity compared to existing methods. Extensive simulations validate our findings, with results illustrating the performance of the proposed algorithms under different parameters, demonstrating significant improvements in channel estimation accuracy and convergence speed over established methods, including NLMS, sparse exponential forgetting window least mean square (SEFWLMS), and sparse hybrid adaptive filtering algorithms (SHAFA).…”
Get full text

A survey on intrusion detection system in IoT networks by Md Mahbubur Rahman, Shaharia Al Shakil, Mizanur Rahman Mustakim

“…Additionally, the survey identifies significant challenges and open issues in ML and DL-based IDS for IoT networks, such as computational complexity and high false positive rates, and recommends potential research directions, emerging trends, and perspectives for future work. …”
Get full text

Integration in CNN and FIR filters for improved computational efficiency in signal processing by A. Sridevi, A. Sathiya

“…The results corroborate the multiplier’s efficiency in decreasing the computational complexity and enhancing the possibility of real-time analysis of CNN-based systems in healthcare.…”
Get full text

Novel techniques for efficient PAPR reduction in NOMA systems for future wireless networks by Inam Abousaber, Amira A. Mohamed, Haitham F. Abdallah

“…PTS-ISSA minimizes PAPR by phase rotation of sub-blocks, offering the best reduction but at higher computational complexity, making it ideal for systems with abundant resources. …”
Get full text

Multifeature Fusion Detection Method for Fake Face Attack in Identity Authentication by Haiqing Liu, Shiqiang Zheng, Shuhua Hao, Yuancheng Li

“…Experimental results show that this method can improve detection accuracy while also reducing computational complexity. In this paper, we use the CASIA, PRINT-ATTACK, and REPLAY-ATTACK database to compare the various LBP algorithms that incorporate optical flow and fusion algorithms.…”
Get full text

A Randomized Non‐overlapping Encryption Scheme for Enhanced Image Security in Internet of Things (IoT) Applications by Muhammad Aqeel, Arfan Jaffar, Muhammad Faheem, Muhammad Waqar Ashraf, Nadeem Iqbal, Shahid Yousaf, Hossam Diab

“…Results demonstrate that the algorithm not only ensures strong protection against unauthorized access but also maintains low computational complexity, making it ideal for IoT applications. …”
Get full text

RETRACTED: Intelligent power grid energy supply forecasting and economic operation management using the snake optimizer algorithm with Bigur-attention model by Lingling Cui, Jiacheng Liao

“…The model evaluation phase calculates metrics such as prediction error, accuracy, and stability, and also examines the model’s training time, inference time, number of parameters, and computational complexity to assess its efficiency and scalability. …”
Get full text

Tennis Assistance Technology Based on Dynamic Time Warping Algorithm by Penggang Wang, Pengpeng Zhang, Guanxi Fan

“…This technology combines components such as normalization, support vector machine, joint detection, sparse matrix, and second-order stepping mode to improve algorithm performance and reduce computational complexity. The experiment outcomes indicate that this method can validly raise the training effect of tennis players, with an accuracy rate of 95.66%, a calculation time of 0.32 seconds, a variance of 0.88, and an average absolute error of 4.22. …”
Get full text

Subspace Compressive GLRT Detector for MIMO Radar in the Presence of Clutter by Siva Karteek Bolisetti, Mohammad Patwary, Khawza Ahmed, Abdel-Hamid Soliman, Mohamed Abdel-Maguid

“…While Subspace Compressive GLRT (SSC-GLRT) detector is known to give optimised radar target detection performance with reduced computational complexity, it however suffers a significant deterioration in target detection performance in the presence of clutter. …”
Get full text

VRU-YOLO: A Small Object Detection Algorithm for Vulnerable Road Users in Complex Scenes by Yunxiang Liu, Yuqing Shi

“…Additionally, a lightweight Optimized Shared Detection Head (OSDH-Head) is introduced, reducing computational complexity while improving detection efficiency. …”
Get full text

Identifying Key Bus Stations Based on Complex Network Theory considering the Hybrid Influence and Passenger Flow: A Case Study of Beijing, China by Jianlin Jia, Yanyan Chen, Ning Chen, Hui Yao, Yongxing Li, Zhuo Liu

“…The influence of bus stations was calculated based on the local structure of the network, which refines from finding the shortest paths with high computational complexity. To evaluate the performance of the method, we used the efficiency of the network and vehicle average speed at the station to examine the accuracy. …”
Get full text