Abstract: Heterogeneous image registration is a critical field in computer vision, with broad applications in scene registration, image retrieval, and autonomous driving. Due to differences in sensor ...
Abstract: In this study, we tackle the challenge of optimizing Wi-Fi signal performance through strategic access point (AP) placement, employing genetic algorithms (GAs) to address the complexities of ...
Abstract: Light detection and ranging (LiDAR) is a crucial roadside intelligent perception device in cooperative vehicle infrastructure systems, which can generate a large amount of disordered 3-D ...
Abstract: As the cornerstone of the Internet of Things, the deployment of wireless sensor networks remains a challenging problem, as it is difficult to balance coverage quality and computational ...
Abstract: Many advanced techniques efficiently harvest the global maximum power (GMP) of the photovoltaic (PV) system, including machine learning techniques and metaheuristic algorithms based maximum ...
Abstract: In the realm of computer science, sorting algorithms play a pivotal role in optimising data organisation and retrieval processes across various applications. This paper presents a ...
Abstract: To address the problem of inefficient continuous multi-task scheduling operations, a scheduling model was established with the optimization objective of minimum total scheduling time to ...
Abstract: Photovoltaic arrays receive varying levels of solar radiation due to factors such as shadows created by clouds, surrounding buildings, and other obstructions. Therefore, an effective Maximum ...
Abstract: In this work, we propose a voxel-based single-stage fine-grained and efficient point cloud 3D object detection algorithm to address the inadequate granularity in point cloud feature ...
Abstract: 3D reconstruction is widely used to create 3D representation of 2D images. 3D scanner is a device that takes scans or images of the object or environment and creates the 3D representation of ...
Abstract: This paper presents two new algorithms for point compression for elliptic curves defined over F 2m, m odd. The first algorithm works for curves with Tr(a) = 1 and offers computational ...
Abstract: We expose in a tutorial fashion the mechanisms which underlie the synthesis of optimization algorithms based on dynamic integral quadratic constraints. We reveal how these tools from robust ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results