Results 11 to 20 of about 319,625 (266)
Point Cloud Normal Estimation by Fast Guided Least Squares Representation
IEEE Access, 2020 Normal estimation is an essential task for scanned point clouds in various CAD/CAM applications. The method (GLSRNE) based on guided least squares representation (GLSR) balances speed with quality well among state-of-the-art methods.
Jie Zhang +4 more
doaj +1 more source
Radix-22 Algorithm for the Odd New Mersenne Number Transform (ONMNT)
Signals, 2023 This paper introduces a new derivation of the radix-22 fast algorithm for the forward odd new Mersenne number transform (ONMNT) and the inverse odd new Mersenne number transform (IONMNT).
Yousuf Al-Aali +2 more
doaj +1 more source
A Fast Algorithm for VVC Intra Coding Based on the Most Probable Partition Pattern List
Applied Sciences, 2023 Compared with High-Efficiency Video Coding (HEVC), Versatile Video Coding (VVC) has more flexible division and higher compression efficiency, but it also has higher computational complexity.
Haiwu Zhao +3 more
doaj +1 more source
Algorithm for calculating parameters of mold temperature controller [PDF]
E3S Web of Conferences, 2022 In the problem of mold heating proper parameters of mold temperature controller are important for mold temperature, but the parameters are hard to calculate for numerous computing amount, and simulating its state during heating is also difficult for ...
Liu Hong, Pan Danqi, Jiang Zheqi
doaj +1 more source
Proceedings of the Genetic and Evolutionary Computation Conference, 2017 For genetic algorithms using a bit-string representation of length~$n$, the general recommendation is to take $1/n$ as mutation rate. In this work, we discuss whether this is really justified for multimodal functions. Taking jump functions and the $(1+1)$ evolutionary algorithm as the simplest example, we observe that larger mutation rates give ...
Benjamin Doerr +3 more
openaire +2 more sources
IEEE Access, 2019 Receiver operating characteristic (ROC) analysis has been widely used in two-class problems. However, in practice, three-class problems are frequently encountered, especially in the area of medicine. To evaluate the performance of three-class classifiers,
Shun Liu, Weichao Xu, Xu Sun, Yun Zhang
doaj +1 more source
FAST—Fast Algorithm for the Scenario Technique
Operations Research, 2014 The scenario approach is a recently introduced method to obtain feasible solutions to chance-constrained optimization problems based on random sampling. It has been noted that the sample complexity of the scenario approach rapidly increases with the number of optimization variables and this may pose a hurdle to its applicability to medium- and large ...
Caré, A., Garatti, S., CAMPI, Marco
openaire +4 more sources
Efficient Algorithm for Scattering by a Large Cluster of Moving Objects
IEEE Access, 2019 A highly efficient algorithm for analysis of electromagnetic scattering by a large cluster of independently moving objects is proposed in this paper. A double octree structure is introduced, which consists of a main octree stationary to the cluster as a ...
Hai-Li Zhang +4 more
doaj +1 more source
Fractal and Fractional, 2023 In the current work, a fast θ scheme combined with the Legendre spectral method was developed for solving a fractional Klein–Gordon equation (FKGE). The numerical scheme was provided by the Legendre spectral method in the spatial direction, and for the ...
Yanan Li +3 more
doaj +1 more source
FAST PARALLEL PERMUTATION ALGORITHMS [PDF]
Parallel Processing Letters, 1995 We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n/p) log n) and an improved algorithm with run time O(n/p + log n log log (n/p)). Both algorithms require n additional global bits and O(1) local storage per processor.
Hagerup, Torben, Keller, Jörg
openaire +2 more sources