Sentence examples for efficiently verified from inspiring English sources

In practice, with the proposed system architecture, the realization of multistandard video codec can be greatly facilitated and efficiently verified, other than the H.264 video applications.

Since this condition is hard to be efficiently verified, only necessary conditions are checked: for any interval [ a, a + L - 1], TUIUIU keeps these positions if there exists at least r excellent (or fine or good if the user so prefers) non-overlapping parallelograms Parall a, L, c i, d), with c i ∈ { c1,..., c r }.

This is used to efficiently verify the rigid transformation estimated at each RANSAC iteration.

This paper proposes a verification process which can efficiently verify the translator's correctness using the model checking technique.

With a small example it is argued that the presented architecture together with the EFA formalism can be used to efficiently verify and synthesize control functions that contain both supervisory control and traditional logic control.

In others, like with some African nations, their national bureaucracies can't efficiently verify the identity of their undocumented citizens abroad and issue travel documents.

Electronic records are easier to find and update, enabling Council staff to more efficiently verify a prospective employee's training qualifications.

In order to efficiently verify gate level arithmetic circuits, we model the circuit and the specification with polynomial system and the verification problem is formulated as membership testing of the given specification polynomial in corresponding ideal of the circuit polynomials.

The experimental results show that the proposed verification technique is scalable enough so that large arithmetic circuits can efficiently be verified in reasonable run time and memory usage.

Formal methods can be used efficiently to verify a wide range of systems, including ZigBee protocol stack specification.

Recall that \ \textbf{P}\) can be characterized as the class of problems membership in which can be decided efficiently, whereas \ \textbf{NP}\) can be characterized as the class of problems for which membership can be verified efficiently once an appropriate certificate is provided.