Showing 1 - 20 results of 7,640 for search '(( data processing algorithm ) OR ((( develop based algorithm ) OR ( element each algorithm ))))', query time: 0.32s Refine Results
  1. 1

    The run time for each algorithm in seconds. by Edward Antonian (21453161)

    Published 2025
    “…The goal of this paper is to examine several extensions to KGR/GPoG, with the aim of generalising them a wider variety of data scenarios. The first extension we consider is the case of graph signals that have only been partially recorded, meaning a subset of their elements is missing at observation time. …”
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    Evaluation of model aggregation algorithms. by JiaMing Wang (334865)

    Published 2024
    “…To address these challenges, this paper proposes a federated learning-based intrusion detection algorithm (NIDS-FGPA) that utilizes gradient similarity model aggregation. …”
  11. 11

    Comparison of homomorphic encryption algorithms. by JiaMing Wang (334865)

    Published 2024
    “…To address these challenges, this paper proposes a federated learning-based intrusion detection algorithm (NIDS-FGPA) that utilizes gradient similarity model aggregation. …”
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16

    Flowchart of the new algorithm. by Jinyu Wang (381467)

    Published 2024
    “…To address these problems, we propose a new, efficient real-time SLR data processing method. This algorithm combines single-stage filtering with a histogram-based approach and incorporates polynomial fitting to establish a predictive model. …”
  17. 17
  18. 18
  19. 19

    Algorithms runtime comparison. by Meilin Zhu (688698)

    Published 2025
    “…Firstly, from the perspective of data-driven, it crawls the historical data of driving speed through Baidu map big data platform, and uses a BP neural network optimized by genetic algorithm to predict the driving speed of vehicles in different periods. …”
  20. 20

    The process of using the M.E.D.V.I.S. algorithm. by Hector Torres (11708207)

    Published 2025
    “…All are placed into three dimensionality reduction methods, which are then processed in a k-means clustering algorithm with k = 2 to represent good and bad figures. …”