Algorithm 94. An algorithm for repeated calculations of the generalized Mahalanobis distance
Anna Bartkowiak (1988)
Applicationes Mathematicae
Similarity:
Displaying similar documents to “An analytical iterative statistical algorithm for image reconstruction from projections”
Algorithm 94. An algorithm for repeated calculations of the generalized Mahalanobis distance
An analytical iterative statistical algorithm for image reconstruction from projections
Robert Cierniak (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Algorithm 27. Statistical prediction by the method of harmonical weights
G. Trybuś (1973)
Applicationes Mathematicae
Similarity:
A modified K3M thinning algorithm
Marek Tabedzki, Khalid Saeed, Adam Szczepański (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
The K3M thinning algorithm is a general method for image data reduction by skeletonization. It had proved its feasibility in most cases as a reliable and robust solution in typical applications of thinning, particularly in preprocessing for optical character recognition. However, the algorithm had still some weak points. Since then K3M has been revised, addressing the best known drawbacks. This paper presents a modified version of the algorithm. A comparison is made with the original...
Algorithm 38. Calculation of all marginal means from an n-way table
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Algorithm 29. Solving systems of linear equations by Sokolov's method
S. Lewanowicz (1974)
Applicationes Mathematicae
Similarity:
A modified algorithm for the strict feasibility problem
D. Benterki, B. Merikhi (2010)
RAIRO - Operations Research
Similarity:
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.
Algorithm 37. Solution of sparse linear equation systems
F. Pankowski (1974)
Applicationes Mathematicae
Similarity:
Algorithm 49. An algorithm for solving the machine sequencing problem
A. Adrabiński, J. Grabowski (1977)
Applicationes Mathematicae
Similarity:
Algorithm 61. The solution of a certain linear equation system
Z. Kasperski (1978)
Applicationes Mathematicae
Similarity:
Algorithm 16. Implicit enumeration algorithm for solving zero-one integer programs
J. Kucharczyk (1972)
Applicationes Mathematicae
Similarity:
Algorithm 40. Search for marginal means at given factor levels in an n-way table containing data scores and all marginal means
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Remarks on algorithm 3
Z. Cylkowski, J. Kucharczyk (1970)
Applicationes Mathematicae
Similarity:
Remarks on algorithm 32
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
A. Adrabiński (1976)
Applicationes Mathematicae
Similarity:
Algorithm 24. One-dimensional knapsack function
J. Kucharczyk (1973)
Applicationes Mathematicae
Similarity:
Measuring and maintaining consistency: a hybrid FTF algorithm
James Bunch, Richard Le Borne, Ian Proudler (2001)
International Journal of Applied Mathematics and Computer Science
Similarity:
Due to the versatility as well as its ease of implementation, the Fast Transversal Filters algorithm is attractive for many adaptive filtering applications. However, it is not widely used because of its undesirable tendency to diverge when operating in finite precision arithmetic. To compensate, modifications to the algorithm have been introduced that are either occasional (performed when a predefined condition(s) is violated) or structured as part of the normal update iteration. However,...