Results 21 to 30 of about 130,251 (258)
Output-sensitive algorithm for the edge-width of an embedded graph [PDF]
Proceedings of the twenty-sixth annual symposium on Computational geometry, 2010 Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest non-contractible and a shortest non-separating cycle of G. If k is an integer, we can compute such a non-trivial cycle with length at most k in O(gnk) time, or correctly ...
Sergio Cabello +2 more
openaire +1 more source
Energies, 2021 This work aims to model the combined cycle power plant (CCPP) using different algorithms. The algorithms used are Ridge, Linear regressor (LR), and upport vector regressor (SVR).
Asif Afzal +4 more
doaj +1 more source
Output-sensitive algorithms for Tukey depth and related problems [PDF]
Statistics and Computing, 2008 The Tukey depth (Proceedings of the International Congress of Mathematicians, vol. 2, pp. 523---531, 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algorithms for computing the Tukey depth of a point in various dimensions are considered.
David Bremner +4 more
openaire +2 more sources
Research on Directed Clique Enumeration with Strongly Connected Constraint [PDF]
Jisuanji kexue yu tansuoDirected edges in a directed graph can represent the direction of relationships or the transmission of data. Introducing connectivity constraints in the mining of dense subgraphs can enhance the connections between vertices. Accordingly, by combining the
CHEN Jiujian, DAI Qiangqiang, LI Ronghua, WANG Guoren
doaj +1 more source
An output-sensitive algorithm for computing projections of resultant polytopes [PDF]
Proceedings of the twenty-eighth annual symposium on Computational geometry, 2012 We develop an incremental algorithm to compute the Newton polytope of the resultant, aka resultant polytope, or its projection along a given direction. The resultant is fundamental in algebraic elimination and in implicitization of parametric hypersurfaces.
Ioannis Z. Emiris +3 more
openaire +1 more source
Design of adaptive matching true random number generator based on thermal noise
Dianzi Jishu Yingyong, 2018 After studying on the thermal noise model and the matching mechanism of sensitive amplifier, an adaptively matching True Random Number Generator(TRNG) design is proposed.
Li Zhen, Wang Pengjun, Cheng Xu, Li Gang
doaj +1 more source
Incremental Convex Hull Algorithms Are Not Output Sensitive [PDF]
Discrete & Computational Geometry, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Fault Detection of UHV Converter Valve Based on Optimized Cost-Sensitive Extreme Random Forest
Energies, 2022 Aiming at the problem of unbalanced data categories of UHV converter valve fault data, a method for UHV converter valve fault detection based on optimization cost-sensitive extreme random forest is proposed.
Fuqiang Xiong +5 more
doaj +1 more source
AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES [PDF]
International Journal of Computational Geometry & Applications, 2013 We design an algorithm to compute the Newton polytope of the resultant, known as resultant polytope, or its orthogonal projection along a given direction. The resultant is fundamental in algebraic elimination, optimization, and geometric modeling. Our algorithm exactly computes vertex- and halfspace-representations of the polytope using an oracle ...
Ioannis Z. Emiris +3 more
openaire +3 more sources
IEEE Open Journal of the Industrial Electronics Society, 2023 This article presents a free-harmonic ac/dc/ac converter structure using a novel modulation approach for asymmetrical cascade H-bridge multilevel inverter and, conventional rectifiers combined with a shunt active filter, for grid ...
Nabil Karania +3 more
doaj +1 more source