Sentence examples for minimal subset of from inspiring English sources

In previous work, a minimal subset of the lattice-commensurate triangles was proposed as the primary data set.

They proposed an approximation algorithm for choosing a minimal subset of candidate locations where SGs may be deployed.

We identify the minimal subset of XPath that is needed, thus allowing matching programs to potentially use a smaller memory footprint.

To overcome this limitation, this paper has investigated and compared three well-known multivariate filter methods to determine a minimal subset of relevant and non-redundant features.

Let E be the minimal subset of C as obtained in the proof of Theorem 2 which is nonempty, weakly compact, and convex, T-invariant.

A common assumption for logic-based argumentation is that an argument is a pair ⟨Φ,α⟩ where Φ is minimal subset of the knowledge-base such that Φ is consistent and Φ entails the claim α.

(iv) (forall U, U in 2^{mathcal A}: varnothing subset U subseteq V), we have ({U} cap Minimal(V subseteq Minimal(U)), i.e. if (exists Min U cap Minimal(V)), then ({M} in Minimal(U)), where the set Minimal(U) consists of all minimal subsets of elements of U according to the normal order relation "(subseteq )" on subsets.

(forall U, U in 2^{mathcal A}: varnothing subset U subseteq V), we have ({U} cap Minimal(V subseteq Minimal(U)), i.e. if (exists Min U cap Minimal(V)), then ({M} in Minimal(U)), where the set Minimal(U) consists of all minimal subsets of elements of U according to the normal order relation "(subseteq )" on subsets.

By operating on minimal subsets of voxels defined by the octree, our algorithm avoids many of the computational constraints encountered by previous spine analysis techniques [41], [43].

Within our framework, we apply the concept of a Markov blanket in order to be able to identify minimal subsets of discriminative features resulting from the exploration of KJ-strongly relevant feature-pairs by using the measures of R2-correlation.

Then we can use the Zorn lemma to obtain a minimal subset (K_{1}) of K which is closed, convex and invariant under T. If (delta(K_{1}) = 0), the problem is solved since in this case (K_{1} = {x_{0}}), and thus (T(x_{0}) = x_{0}).