Results 271 to 280 of about 1,090,569 (315)
Some of the next articles are maybe not open access.
An Enhanced Method for the Snake Algorithm
First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06), 2006The snakes algorithm is an image segmentation process that utilises energy-minimising splines. The energy terms are obtained from discrete points that make up a snake and the gray-level values in an image. An algorithm for automated positioning of the initial snake points is presented by the authors, together with two additional energy terms (intensity
Charles C. H. Lean +2 more
openaire +1 more source
An algorithm for Adomian decomposition method
Applied Mathematics and Computation, 2004The decomposition method, proposed by \textit{G. Adomian} [J. Math. Anal. Appl. 102, 420--434 (1984; Zbl 0554.60065)], used initially to solve partial differential equations, has been extended to solve a wide class of problems: linear and nonlinear deterministic and stochastic problems, from physics, biology and chemical reactions.
Wenhai Chen, Zhengyi Lu
openaire +2 more sources
2019
The camera captured text images have various aspects to investigate. Generally, the emphasis of research depends on regions of interest. Sometimes the focus could be on color segmentation, object detection, or scene text analysis. The image analysis, visibility, and layout analysis are the tasks easier for humans as suggested by behavioral trait of ...
Saad Bin Ahmed +2 more
openaire +1 more source
The camera captured text images have various aspects to investigate. Generally, the emphasis of research depends on regions of interest. Sometimes the focus could be on color segmentation, object detection, or scene text analysis. The image analysis, visibility, and layout analysis are the tasks easier for humans as suggested by behavioral trait of ...
Saad Bin Ahmed +2 more
openaire +1 more source
The contraction method for recursive algorithms
Algorithmica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rösler, Uwe, Rüschendorf, Ludger
openaire +3 more sources
Noise in algorithm refinement methods
Computing in Science & Engineering, 2005Hybrid or algorithm refinement (AR) schemes have focused mainly on the mean behavior of system states. However, variances in these behaviors, such as spontaneous fluctuations, are important for modeling certain phenomena. This paper discusses the effects of statistical fluctuations on hybrid computational methods that combine a particle algorithm with ...
Francis J. Alexander +2 more
openaire +1 more source
An algorithmic method for protocol conversion
[1992] Proceedings of the 12th International Conference on Distributed Computing Systems, 2003An algorithmic method for constructing protocol converters to achieve interoperability between networks that implement incompatible protocols is presented. The converter constructed using this approach does not cause unspecified receptions or deadlocks if the original protocols are safe.
Mohammad Peyravian, Chin-Tau A. Lea
openaire +1 more source
The algorithm of the method of difference potentials
USSR Computational Mathematics and Mathematical Physics, 1985An algorithm for the numerical solution of boundary integral equations, obtained using a reduction of Calderón-Seeley type, is described. The algorithm is based on using difference potentials to approximate the surface potentials which develop as a result of the reduction.
Reznik, A. A. +3 more
openaire +1 more source
Nonmonotone Algorithms for Pattern Search Methods
Numerical Algorithms, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GASPARO, MARIA GRAZIA +2 more
openaire +1 more source
Quantum Algorithm for Crowding Method
2018The purpose of this paper is to introduce a simple, basic, yet intuitive method to exploit Grover’s search algorithm on crowding method, a part of general evolutionary algorithm. Specifically, Grover’s algorithm’s capability of “finding multiple needles in a haystack” provides a new, quantum way to properly select a parent individual out of the ...
Jun Suk Kim, Chang Wook Ahn
openaire +1 more source
A Gradient Projection Algorithm for Relaxation Methods
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1983We consider a particular problem which arises when apply-ing the method of gradient projection for solving constrained optimiza-tion and finite dimensional variational inequalities on the convex set formed by the convex hull of the standard basis unit vectors.
John L. Mohammed +2 more
openaire +2 more sources