Results 141 to 149 of about 149 (149)

An Algorithm for Splitting Arbitrary Polygon

2009 Fifth International Conference on Natural Computation, 2009
An algorithm for splitting arbitrary polygons with a polyline is described in this paper. Starting from introducing the existing theories in computational geometry and computer graphics, the paper describes the three major steps of this algorithm: 1) search lines with the sweep-line algorithm based on sorted edges of polygon, splitting plotline, and ...
Liang Wu, Guang Tian, Zhong Xie
openaire   +2 more sources

An improved phase-splitting algorithm

Computers & Chemical Engineering, 1988
Abstract An improvement of the phase-splitting algorithm of Gautam and Seider (1979) is developed. A maximum of three line-minimizations is used after performing the algorithm of Gautam and Seider to determine whether the liquid phase is stable or not and, if the latter is true, to improve significantly the estimated compositions of the phases in ...
P. Van Rompay, F.F.Y. Walraven
openaire   +2 more sources

Algorithm for splitting planar faces

Computer-Aided Design, 1987
Abstract An algorithm is presented that converts an object, defined by a set of intersecting planar faces, to a set of nonintersecting faces — that is, it splits the faces that intersect each other into several smaller faces that touch only at common edges and vertices. All singularities are handled in a uniform manner.
openaire   +2 more sources

Splitting algorithms in noisy channels with memory

IEEE Transactions on Information Theory, 1989
Multi-access networks are considered in which the shared channel is noisy. The authors assume a slotted-time collision-type channel, Poisson infinite-user model, and binary feedback. Due to the noise in the shared channel, the received signal may be detected as a collision even though no message or a single message is transmitted.
I. Kessler, Moshe Sidi
openaire   +3 more sources

The gradient adaptive split lattice algorithm

[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, 1992
A new algorithm for adaptive filtering of autoregressive processes is presented. The new algorithm is based on a three-term recurrence that replaces, but is mathematically equivalent to, the lattice equations of the gradient adaptive lattice (GAL) algorithm of Griffiths (1977).
Chi-Hsin Wu, Andrew E. Yagle
openaire   +3 more sources

Adaptive Splitting and Selection Algorithm for Regression

New Generation Computing, 2015
Developing system for regression tasks like predicting prices, temperature is not a trivial task. There are many of issues which must be addressed such as: selecting appropriate model, eliminating irrelevant inputs, removing noise, etc. Most of them can be solved by application of machine learning methods.
openaire   +2 more sources

Split-Radix FFT Algorithms

2019
This chapter presents split-radix FFT algorithms. First, split-radix FFT algorithm is given. Next, extended split-radix FFT algorithm is described.
openaire   +2 more sources

Comparison of splitting algorithms for the rigid body

Journal of Computational Physics, 2003
We compare several different second-order splitting algorithms for the asymmetric rigid body, with the aim of determining which one produces the smallest energy error for a given rigid body, namely, for given moments of inertia. The investigation is based on the analysis of the dominant term of the modified Hamiltonian and indicates that different ...
openaire   +3 more sources

Extensions of the CQ Algorithm for the Split Feasibility and Split Equality Problems

2017
International ...
Moudafi, Abdellatif, Byrne, Charles L
openaire   +2 more sources