Showing 321 - 340 results of 684 for search '"computational complexity"', query time: 0.07s Refine Results
  1. 321

    Lightweight multidimensional feature enhancement algorithm LPS-YOLO for UAV remote sensing target detection by Yong Lu, Minghao Sun

    Published 2025-01-01
    “…We propose LPS-YOLO, which improves small target feature extraction while reducing computational complexity by replacing the Conv backbone with SPDConv to retain fine-grained features. …”
    Get full text
    Article
  2. 322

    Root-MUSIC-based joint TOA and DOA estimation in IR-UWB by Fang-qiu WANG, Xiao-fei ZHANG, Fei WANG

    Published 2014-02-01
    “…The parameters can be estimated via two-dimensional (2D) multiple signal classification (MUSIC) algorithm, in which the two-dimensional spectral peak searching, however, requires much higher computational complexity. Aiming at this, an algorithm of root-MUSIC-based joint TOA and DOA estimation in IR-UWB system was proposed. …”
    Get full text
    Article
  3. 323

    Downlink wireless resource allocation method of V2X based on wireless sensing assistance by Zhimin HE, Yuzhe LIN, Yujie CHENG, Shi YAN

    Published 2022-09-01
    “…In vehicle-to-everything, the high-speed distribution and sharing of perception and safety data is crucial to road safety.However, the instability of communication links caused by high-speed vehicle movement will make the existing communication resource allocation methods based on vehicle location information reporting no longer efficient.Therefore, a downlink wireless resource allocation method based on wireless sensing assistance of communication nodes was proposed.Firstly, a joint optimization problem of communication mode selection and wireless resource allocation under the orthogonality of communication and sensing resources was constructed.Then, a communication mode selection based on clustering by Delaunay triangulation and a resource allocation strategy based on improved graph coloring to improve the downlink throughput was proposed to solve the problem of construction.Finally, the impact of wireless sensing estimation error and the number of vehicles on the performance of the algorithm was simulated and analyzed.Simulation results show that compared with traditional methods, the proposed algorithm can obtain better downlink communication performance gain under the same proportion of sensing bandwidth resources, and can withstand the impact of larger sensing errors on performance.At the same time, the computational complexity of the proposed algorithm is lower and the network computing resources can be saved.…”
    Get full text
    Article
  4. 324

    Human and Machine: A View through Kant's Use of Regulative Reason by Ümit Taştan

    Published 2024-12-01
    “…We justify this claim through the problem of “narrowing the brute search space” in computational complexity, which is a significant issue in computer science. …”
    Get full text
    Article
  5. 325

    HistoNeXt: dual-mechanism feature pyramid network for cell nuclear segmentation and classification by Junxiao Chen, Ruixue Wang, Wei Dong, Hua He, Shiyong Wang

    Published 2025-01-01
    “…In addition, computational complexity, measured in Giga Floating Point Operations Per Second (GFLOPS), was used as an indicator of resource consumption. …”
    Get full text
    Article
  6. 326

    Sparse Representation Based Range-Doppler Processing for Integrated OFDM Radar-Communication Networks by Bo Kong, Yuhao Wang, Henry Leung, Xiaohua Deng, Huilin Zhou, Fuhui Zhou

    Published 2017-01-01
    “…Additionally, a Doppler frequency detector is exploited to decrease the computational complexity. Numerical simulations show that the proposed method outperforms the traditional modulation Symbol-Domain method under ideal and realistic nonideal scenarios.…”
    Get full text
    Article
  7. 327

    Robust angle estimation method for noncircular targets in MIMO radar with mutual coupling by Xianpeng WANG, Yuehao GUO, Mengxing HUANG, Chong SHEN, Chunjie CAO, Wenlong FENG

    Published 2019-07-01
    “…A robust angle estimation method for noncircular targets based on unitary tensor decomposition with mutual coupling in multiple-input multiple-output (MIMO) radar was proposed.Firstly,utilizing the banded symmetric Toeplitz structure of the mutual coupling matrix to eliminate the influence of unknown mutual coupling in tensor field.Then a special augmented tensor was constructed to capture the no circularity and its inherent tensor multidimensional structure of noncircular signals.And taking advantage of the centro-Hermitian characteristic of the augmented tensor to transform the sub-tensor into real-values tensor by the unitary transformation.Finally,the signal subspace estimation based on tensor was obtained by taking advantage of the higher-order singular value decomposition (HOSVD) technology,and then the direction-of-departure (DoD) and direction-of-arrival (DoA) estimation was obtained by utilizing the real-values subspace technology.Due to the consideration of both the noncircularity and multidimensional structure,the proposed algorithm has better recognition performance than the existing angle estimation methods.At the same time,the proposed algorithm only requires real-valued operations and has lower computational complexity.Simulation experiments verify the effectiveness and superiority of the proposed algorithm.…”
    Get full text
    Article
  8. 328

    Review of the matched asymptotic approach of the coupled criterion by Jiménez-Alfaro, Sara, García, Israel García, Doitrand, Aurélien

    Published 2025-02-01
    “…One of its key uses is in Fracture Mechanics, where it provides accurate approximations in the vicinity of the crack tip with low computational complexity. This method can be seamlessly integrated with the Coupled Criterion (CC), which enables the prediction of crack nucleation and propagation in brittle materials. …”
    Get full text
    Article
  9. 329

    PEM-PCA: A Parallel Expectation-Maximization PCA Face Recognition Architecture by Kanokmon Rujirakul, Chakchai So-In, Banchar Arnonkijpanich

    Published 2014-01-01
    “…However, the covariance matrix and eigenvalue decomposition stages cause high computational complexity, especially for a large database. …”
    Get full text
    Article
  10. 330

    Integration of a Large-Scale Genetic Analysis Workbench Increases the Accessibility of a High-Performance Pathway-Based Analysis Method by Sungyoung Lee, Taesung Park

    Published 2018-12-01
    “…The rapid increase in genetic dataset volume has demanded extensive adoption of biological knowledge to reduce the computational complexity, and the biological pathway is one well-known source of such knowledge. …”
    Get full text
    Article
  11. 331

    Integrated energy microgrids participating in voltage regulation ancillary services: An improved ADMM based distributed optimization approach by Hao Xiao, Wei Pei, Daoxin Han, Xiaowei Pu, Jiarui Wang

    Published 2024-12-01
    “…This paper constructs a distributed optimization model for the IEMs participating in voltage regulation ancillary services by considering multiple physical network constraints. To reduce computational complexity, the DistFlow power flow model and the second‐order cone relaxation method are introduced to transform the optimization model into a second‐order cone programming problem. …”
    Get full text
    Article
  12. 332

    Improved LDPC-based short-range frequency-hopping wireless communication system by Wei-dong FANG, Wu-xiong ZHANG, Ming-ming HU, Wei CHEN, Yang YANG

    Published 2017-12-01
    “…In short-range wireless communication system(SWCS),the complex scenarios make its transmission face the diverse interference,and lower hardware resource leads to its limited anti-interference capability.To achieve the reliable transmission,a frequency-hopping-based SWCS (FH-SWCS)with improved LDPC (I-LDPC) code was constructed.In FH-SWCS,a low-complexity check-sum updating(LCU)algorithm was proposed to reduce the amount of computation.LCU-based multi-threshold bit flipping (LCU-MTBF) algorithm was given to increase the reliability of bit-flipping, improving decoding performance and reduce the complexity of decoding.The simulation results demonstrate that LCU is suitable for multiple hard decisions decoding algorithm,and it can reduce the computational complexity of original decoding algorithm without affecting its performance.When BER is 10<sup>−5</sup>,and iterations number is 5,0.15dB performance gain can be achieved,and the number of additions algorithm can be reduced about 40% in LCU-MTBF.In FH-SWCS with I-LDPC,when BER is 10<sup>−4</sup>,and SNR is 15dB,the performance gain about 7dB can be achieved to improve the anti-interference of the system effectively.…”
    Get full text
    Article
  13. 333

    Dynamic adaptive offloading method based on WPT-MEC by Lin SU, Xiaochao DANG, Zhanjun HAO, Chunrui RU, Xu SHANG

    Published 2022-12-01
    “…For the dynamic fading time-varying channel state information, a dynamic adaptive offloading (RLDO) method based on WPT-MEC was proposed to solve the task offloading and resource optimization problems for multiple users by combining wireless power transmission (WPT) technology and mobile edge computing (MEC).The wireless power transmission technology can provide energy to wireless end-user (WEU) and effectively alleviate the problem of limited energy supply from conventional batteries.To maximize the resource utilization, a wireless powered MEC network model was designed where the energy collected by the wireless end-user from the wireless access point (AP) was stored in a rechargeable battery, and then this energy was used for task computation or task offloading.The approach performed real-time offloading decisions through a fully connected deep neural networks (DNN) deployed in the MEC server.A fully binary offloading strategy was used for the offloading decision.Simulation results show that the computation rate of the method can still be maintained above 92% in a multi-user time-varying wireless channel-oriented environment.Compared with the basic method, it has great advantages in improving the calculation rate, reducing the delay and energy consumption,and effectively reduces computational complexity.…”
    Get full text
    Article
  14. 334

    Online Coregularization for Multiview Semisupervised Learning by Boliang Sun, Guohui Li, Li Jia, Kuihua Huang

    Published 2013-01-01
    “…For practical purpose, we also propose two sparse approximation approaches for kernel representation to reduce the computational complexity. Experiments show that our derived online coregularization algorithms achieve risk and accuracy comparable to offline algorithms while consuming less time and memory. …”
    Get full text
    Article
  15. 335

    Lightweight anomaly detection model for UAV networks based on memory-enhanced autoencoders by HU Tianzhu, SHEN Yulong, REN Baoquan, HE Ji, LIU Chengliang, LI Hongjun

    Published 2024-04-01
    “…The hierarchical clustering algorithm was used to divide the composite statistical features, and the separated features were input to multiple small memory-enhanced autoencoders in the integrated architecture for independent training, which reduced the computational complexity and solved the problem of false negatives caused by the overfitting of the reconstruction effect of the traditional autoencoder. …”
    Get full text
    Article
  16. 336

    A REAL TIME FACE RECOGNITION SYSTEM USING ALEXNET DEEP CONVOLUTIONAL NETWORK TRANSFER LEARNING MODEL by LAWRENCE O. OMOTOSHO, IBRAHIM K. OGUNDOYIN, JOSHUA O. OYENIYI, OLUWASHINA A. OYENIRAN

    Published 2021-10-01
    “…The most important issue, regardless of the method used in the face recognition system, is dimensionality and computational complexity, especially when operating on large databases. …”
    Get full text
    Article
  17. 337

    Deep Transfer Learning Method Based on 1D-CNN for Bearing Fault Diagnosis by Jun He, Xiang Li, Yong Chen, Danfeng Chen, Jing Guo, Yan Zhou

    Published 2021-01-01
    “…However, as the number of samples increases, the interdomain distribution discrepancy measurement of the existing method has a higher computational complexity, which may make the generalization ability of the method worse. …”
    Get full text
    Article
  18. 338

    CoGraphNet for enhanced text classification using word-sentence heterogeneous graph representations and improved interpretability by Pengyi Li, Xueying Fu, Juntao Chen, Junyi Hu

    Published 2025-01-01
    “…However, it faces challenges in computational complexity and interpretability. In this work, we propose CoGraphNet, a novel graph-based model for text classification, addressing key issues. …”
    Get full text
    Article
  19. 339

    Estimating time and frequency under imperfect channel knowledge using ECM and SAGE algorithms in multi-relay cooperative networks by Ezhilazhagan Chenguttuvan, Lakshmi Prabha Karuppiah, Karuppanan Sakthisudhan

    Published 2025-01-01
    “…To demonstrate improved bit error rate (BER) performance, MCFOs and MTOs should be treated with less computational complexity. At the receiver end, the maximum likelihood (ML) approach is used to decode data and estimate offsets. …”
    Get full text
    Article
  20. 340

    Modified complex multitask Bayesian compressive sensing using Laplacian scale mixture prior by Qilei Zhang, Lei Yu, Feng He, Yifei Ji

    Published 2022-07-01
    “…More importantly, the authors not only present the iterative algorithm but also develop the sub‐optimal fast implementation method based on the marginal likelihood maximisation, which dramatically reduce the computational complexity. Finally, sufficient numerical simulations validate the better performance of the proposed algorithm in reconstruction accuracy and computational effectiveness than existing work. …”
    Get full text
    Article