Algorithm 82. Stepwise selection of discriminative variables by the use of the Wilks criterion
Anna Bartkowiak (1982)
Applicationes Mathematicae
Similarity:
Anna Bartkowiak (1982)
Applicationes Mathematicae
Similarity:
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.
J. Kucharczyk (1973)
Applicationes Mathematicae
Similarity:
Z. Cylkowski, J. Kucharczyk (1970)
Applicationes Mathematicae
Similarity:
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
Z. Kasperski (1978)
Applicationes Mathematicae
Similarity:
A. Adrabiński, J. Grabowski (1977)
Applicationes Mathematicae
Similarity:
Krystyna Jerzykiewicz (1970)
Applicationes Mathematicae
Similarity:
A. Adrabiński (1976)
Applicationes Mathematicae
Similarity:
Anna Bartkowiak (1975)
Applicationes Mathematicae
Similarity:
F. Pankowski (1974)
Applicationes Mathematicae
Similarity:
E. Neuman (1974)
Applicationes Mathematicae
Similarity:
J. Kucharczyk (1972)
Applicationes Mathematicae
Similarity:
Z. Cylkowski (1971)
Applicationes Mathematicae
Similarity:
E. Neuman (1974)
Applicationes Mathematicae
Similarity:
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...