Sentence examples for a 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.

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.

In this paper, a systems-theoretic modeling is realized by analyzing a minimal subset of biological circuit elements necessary to be included in an MC nanonetwork design where the message-bearing molecules are propagated via free diffusion between two cells.

In this paper, we address the robust minimal controllability problem, where the goal is, given a linear time-invariant system, to determine a minimal subset of state variables to be actuated to ensure controllability under additional constraints.

Using Zorn's Lemma, we obtain a minimal element K in F. Then K be a minimal subset of C with respect to being nonempty, closed, convex and satisfying the property.

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}).

A similar approach with the purpose of aggregating an ideally minimal subset of inputs with strong discriminative capability was described by Filippone et al. [ 28, 29].

The reduct, originating from the Classic Rough Set Approach (CRSA), is an inclusion minimal subset of attributes that provides discernibility between objects from different classes in at least the same degree as the set of all attributes.

(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.