Results 11 to 20 of about 1,575,789 (284)
Maximally fast coarsening algorithms [PDF]
Physical Review E, 2005 We present maximally-fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time-step $ t=A t_s^{2/3}$. For non-conserved systems, only effectively finite timesteps are accessible for similar unconditionally stable algorithms.
Cheng, Mowei, Rutenberg, Andrew
openaire +3 more sources
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
Fast 3D-HEVC Depth Intra Coding Based on Boundary Continuity
IEEE Access, 2021 The encoding format of the 3D extension of high efficiency video coding (3D-HEVC) consists of a multiview color texture and an associated depth map. Because of the unique characteristics of the depth map, advanced coding techniques are designed for depth
Mei-Juan Chen +7 more
doaj +1 more source
Fast Control for Backlight Power-Saving Algorithm Using Motion Vectors from the Decoded Video Stream
Sensors, 2022 Backlight power-saving algorithms can reduce the power consumption of the display by adjusting the frame pixels with optimal clipping points under some tradeoff criteria. However, the computation for the selected clipping points can be complex.
Shih-Lun Chen +7 more
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 ...
Doerr, Benjamin +3 more
openaire +3 more sources
Ising Model for Interpolation of Spatial Data on Regular Grids
Entropy, 2021 We apply the Ising model with nearest-neighbor correlations (INNC) in the problem of interpolation of spatially correlated data on regular grids. The correlations are captured by short-range interactions between “Ising spins”.
Milan Žukovič +1 more
doaj +1 more source
Fast greedy triangulation algorithms [PDF]
Proceedings of the tenth annual symposium on Computational geometry - SCG '94, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dickerson, Matthew T. +3 more
openaire +2 more sources
A Multithreaded Algorithm for the Computation of Sample Entropy
Algorithms, 2023 Many popular entropy definitions for signals, including approximate and sample entropy, are based on the idea of embedding the time series into an m-dimensional space, aiming to detect complex, deeper and more informative relationships among samples ...
George Manis +2 more
doaj +1 more source
The Algorithm and Structure for Digital Normalized Cross-Correlation by Using First-Order Moment
Sensors, 2020 Normalized cross-correlation is an important mathematical tool in digital signal processing. This paper presents a new algorithm and its systolic structure for digital normalized cross-correlation, based on the statistical characteristic of inner-product.
Chao Pan +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