An Efficient Algorithm for Computing the Distance Between Close Partitions

Structure of the paper In the following section, we apply known results to obtain estimates of the energy of optimal partitions in the case of a disk, a square or an

From experiments using several public data sets and ran- dom data, this paper shows that In-Close is in the order of 20 times faster than Krajca.. In-Close is small,

Meyer K (1989) Restricted maximum likelihood to estimate variance components for animal models with several random effects using a derivative-free algorithm. User

The fundamental matrix is estimated on the points belonging to the background; the correspondences on the tree on the foreground lead consequently to more uncertain epipolar lines.

The next multicolumns exhibit the results obtained on instances 1.8 and 3.5: “P rimal best ” presents the average value of the best integer solution found in the search tree; “Gap

Structure of the paper In the following section, we apply known results to obtain estimates of the energy of optimal partitions in the case of a disk, a square or an

This approach, called the Fuzzy EM (FEM) method, is illustrated using three classical problems: normal mean and variance estimation from a fuzzy sample, multiple linear regression

The paper presents an algorithm for finding the maximum independent set in an undirected graph with absolute estimate of the accuracy.. Special notions are indroduced and