Results 31 to 40 of about 287,409 (230)
IEEE Access, 2019 Splitting and combination are two important events of group target motion. However, the existing tracking approaches for group target splitting and combination events suffer the problems of high-computational cost and low accuracy.
Linhai Gan, Gang Wang
doaj +1 more source
Statistical Sources of Variable Selection Bias in Classification Tree Algorithms Based on the Gini Index [PDF]
, 2005 Evidence for variable selection bias in classification tree algorithms based on the Gini Index is reviewed from the literature and embedded into a broader explanatory scheme: Variable selection bias in classification tree algorithms based on the Gini ...
Strobl, Carolin
core +2 more sources
Two New Modified Regularized Methods for Solving the Variational Inclusion and Null Point Problems
Mathematics, 2023 In this article, based on the regularization techniques, we construct two new algorithms combining the forward-backward splitting algorithm and the proximal contraction algorithm, respectively.
Yuanheng Wang +3 more
doaj +1 more source
Information, 2021 Providing fair and convenient comparisons between recommendation algorithms—where algorithms could focus on a traditional dimension (accuracy) and/or less traditional ones (e.g., novelty, diversity, serendipity, etc.)—is a key challenge in the recent ...
François Fouss, Elora Fernandes
doaj +1 more source
Distributed Verification of Rare Properties using Importance Splitting Observers [PDF]
, 2015 Rare properties remain a challenge for statistical model checking (SMC) due to the quadratic scaling of variance with rarity. We address this with a variance reduction framework based on lightweight importance splitting observers.
Jegourel, Cyrille +3 more
core +5 more sources
Electronics Letters, 1984 A new N = 2n fast Fourier transform algorithm is presented, which has fewer multiplications and additions than radix 2n, n = 1, 2, 3 algorithms, has the same number of multiplications as the Raderi-Brenner algorithm, but much fewer additions, and is numerically better conditioned, and is performed ‘in place’ by a repetitive use of a ‘butterfly’-type ...
P. Duhamel, H. Hollmann
openaire +1 more source
Hypergraph cuts with edge-dependent vertex weights
Applied Network Science, 2022 We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance of vertices within a hyperedge, thus leading to better characterized cut ...
Yu Zhu, Santiago Segarra
doaj +1 more source
Distributed Real-Time Model of the M3C for HIL Systems Using Small-Scale Simulators
IEEE Open Journal of Power Electronics, 2021 Hardware-in-the-loop systems are an essential tool to verify controllers and deployed control algorithms in a risk-free environment. The inaccessibility of the converters used in applications such as pumped hydro storage power plants due to their high ...
Philippe Bontemps +2 more
doaj +1 more source
A cure for the sonic point glitch [PDF]
, 2000 Among the various numerical schemes developed since the '80s for the computation of the compressible Euler equations, the vast majority produce in certain cases spurious pressure glitches at sonic points.
Gressier, Jérémie +1 more
core +1 more source
Fourth Order Gradient Symplectic Integrator Methods for Solving the Time-Dependent Schr\"odinger Equation [PDF]
, 2000 We show that the method of splitting the operator ${\rm e}^{\epsilon(T+V)}$ to fourth order with purely positive coefficients produces excellent algorithms for solving the time-dependent Schr\"odinger equation.
Chen, C. -R., Chin, Siu A.
core +2 more sources