Sentence examples for finer partition from inspiring English sources

It turns out that EQI measures how well possible outcomes can distinguish between hypotheses in a way that reflects the intuition that a finer partition of the possible outcomes is more informative.

A partition (mathcal {P}') is a refinement of a partition (mathcal {P}) if and only if each block of (mathcal {P}') is a subset of some block in (mathcal {P}), i.e., a refinement splits a block B i in sub-blocks generating a finer partition.

The finer partition reveal other generally accepted regions like north of Transylvania, south of Transylvania, Banat and the Szekler region (Figure 7).

We also validated the notion that there is an advantage in considering a finer partition of the terminal parts.

While clustering results from DAPC and STRUCTURE were highly congruent, we chose the finer partition results from DAPC in the IM analysis.

We can refine the current partition T α and obtain a finer partition T α ′ with an additional box by bisecting a box t ∈ T α along the midpoint of its side with the maximal width into a left box t L and a right box t R.

Interactive services, in particular, benefit from these architectures since a finer partitioning of the coverage area allows for parallel data stream transmissions.

Therefore, taking these highest amplitudes into consideration using the 'classical' generalized inverse method would require a finer partitioning of the cdf, which would produce a typical set made up of a huge amount of elements.

The agglomerative process continues until obtaining as many communities as connected components of the graph, and the obtained result is a set of locally optimal partitions ({mathscr{C}}_{t}) for every resolution t, and such that the finer partitions are refinements of the coarser-grained ones.

In order to construct a typical set with a reasonable value for ℓ, we propose to accommodate the above-mentioned method by performing a non-uniform partitioning of G n 's cdf, and, as high amplitudes are important in terms of moments, we proceed with a finer partitioning of the [0, 1] segment for values close to 1.

Intending to achieve an algorithm characterized by the quick convergence of hard c-means (HCM) and finer partitions of fuzzy c-means (FCM), suppressed fuzzy c-means (s-FCM) clustering was designed to augment the gap between high and low values of the fuzzy membership functions.