Therefore, we employ an asymmetric binary coding strategy based on the maximum inner product search (MIPS), which not only makes it easier to learn the binary coding functions, but also preserves the non-linear characteristics of the neuron morphological data.
Indels were then coded using the simple indel coding strategy (Simmons and Ochoterena 2000), implemented in SeqState, and mapped on the ML tree performing a maximum parsimony analysis in PAUP* v. 4.0b10 (Swofford 2000).
Here, we employ the coding strategy introduced in [20].
In addition, a variable quantization of asymmetric coding strategy is used in HBP coding architecture.
Intuitively, (17) represents that the maximum coding gain is two because two packets are coded.
ABSRC utilizes a two-phase sparse coding strategy.
Besides, since the coalition value of (mathcal {G}^{l}) is the maximum achievable throughput by a single member small cell, game (mathcal {G}^{l}) has a transferable utility, i.e., the achievable throughput can be arbitrarily portioned among the small cells of a coalition (for example, via the proper choice of coding strategy [18]).
However, since the state definition and evolution is intertwined with the coding strategy used, we first describe the possible coding strategies.
A coding strategy was developed and modified through five rounds of coding, discussion, modification of the coding strategy and re-coding.
The coding strategy was "rich" and not mutually exclusive.
