Sentence examples for chunk v from inspiring English sources

We call (mathcal {I}_{v}) chunk v and i e an overlapping packet of chunk v.

Clearly, for any chunk v, the largest index in (mathcal {I}_{v}) is less than or equal to mv.

After l+1 iterations of the BP decoding, whether all the input packets in chunk v are recovered is determined by G l (v).

Therefore, the common packet of chunk u and chunk v can be decoded with probability at least (1- 1-{alpha _{d}^{l}}(0))(1- 1-{alpha}^{l+1}(0))), which approaches λ d when n goes to infinity.

For any generator graph G= V,E), a node v∈V is said to be l decodable if all the input packets in chunk v can be decoded when the decoding process is applied on G l (v).

It's kinda like a Best Friend DJ battle featuring Blowing Chunks vs Ann Ominous, Commission Flats vs Blabe Runner and Sex on Dexx vs Whisky Business.

To evaluate the importance of the precise spike timing of gamma neurons, we compared decoding (see 'Materials and methods') using spike patterns (i.e., spikes labelled with their precise timing w.r.t. chunk onset) vs those obtained from plain spike counts (i.e., unlabelled spikes).

For delivery possibility of a data chunk on vehicle v i to the destination vehicle v j, it is the same as (q_{i}^{j}) since the better the contact quality, the more opportunities to deliver the data.

Finally, we give the definition of the delivery utility DU as shown in Def. 3 for data chunk d k from vehicle v i to v j.

The delivery utility, DU, for a data chunk d k from vehicle v i to v j is defined as the product of its priority and delivery possibility, i.e., (q_{i}^{j}(d_{k} times P_{rio}(d_{k})).

For a leaf node u, since it cannot get any help from other chunks in G l (v), h_{0}=Pr{text{rk}(mathbf{T}_{u})=m}=t_{m}=beta_{0}.