Results 271 to 280 of about 167,516,375 (307)
Some of the next articles are maybe not open access.
Analysis of thinning algorithms
Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition,, 2003Uses a combinatorial approach to analyse the differences of thinning algorithms among iteration and sub-iteration, thinning by coordinate and by edges of patterns. The authors also propose a serial model thinning algorithm in which the skeletons only consist of three types of points: connected points, end-points, and hole-points. >
Edward Y. Y. Zhang, Patrick S. P. Wang
openaire +2 more sources
Analysis of Clustering Algorithms
2016Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar (in some sense or another) to each other than to those in other groups (clusters). It is a main task of exploratory data mining, and a common technique for statistical data analysis, used in many ...
Iryna Zheliznyak +2 more
openaire +2 more sources
An analysis of the GLVQ algorithm
IEEE Transactions on Neural Networks, 1995Generalized learning vector quantization (GLVQ) has been proposed in as a generalization of the simple competitive learning (SCL) algorithm. The main argument of GLVQ proposal is its superior insensitivity to the initial values of the weights (code vectors).
Ana Isabel González +2 more
openaire +2 more sources
ANALYSIS AND ALGORITHMS OF BIFUZZY SYSTEMS
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2004A fuzzy variable is a function from a possibility space to the set of real numbers, while a bifuzzy variable is a function from a possibility space to the set of fuzzy variables. In this paper, a concept of chance distribution is originally presented for bifuzzy variable, and the linearity of expected value operator of bifuzzy variable is proved ...
Jian Zhou 0003, Baoding Liu
openaire +1 more source
Experimental Analysis of Algorithms
2002Summary: This article presents examples from broad research efforts in experimental algorithmics: first, to develop accurate models of computation that allow closer predictions of performance, and second, to extend abstract analyses beyond traditional questions and assumptions.
openaire +2 more sources
Analysis of a shellsort algorithm
BIT, 1973D. L. Shell published in 1959, [4], a fast algorithm for internal sorting. R. M. Frank and R. B. Lazarus pointed out in 1960, [3], a disadvantage in the original design of the algorithm and changes were proposed based on heuristic arguments. J. Boothroyd took care of Frank and Lazarus objections in an elegant algorithm published 1963, [1]. If we change
openaire +2 more sources
Sensitivity analysis of scheduling algorithms
European Journal of Operational Research, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Penz, Bernard +2 more
openaire +4 more sources
Analysis of Covariance Algorithms
Biometrics, 1982Computational algorithms specific to the analysis of covariance are discussed for the treatment of both balanced and unbalanced data. The use of covariance algorithms in the solution of missing data problems is also considered.
openaire +1 more source
Special Issue on Analysis of Algorithms
Combinatorics, Probability and Computing, 2004This special issue is devoted to the Analysis of Algorithms (AofA). Most of the papers are from the Eighth Seminar on Analysis of Algorithms, held in Strobl, Austria, June 23–29, 2002.
Michael Drmota, Wojciech Szpankowski
openaire +2 more sources
Algorithmic analysis of multithreaded algorithms
1997Cilk is a parallel programming language that allows programmers to write multithreaded parallel programs that use computational resources predictably and efficiently. The Cilk language allows programmers to specify the interactions among computational threads in a high-level fashion, and then Cilk's runtime system maps the computation onto available ...
openaire +1 more source