An approach is shown for using the Huffman algorithm indirectly to prove the optimality of a code for an infinite alphabet if an estimate concerning the nature of the code can be made. Attention is… Expand

A number of memory systems that permit access to 1 × pq, pq × 1 and/or p × q subarrays of an image array, where p and q are design parameters are described.Expand

Batcher shows that a basic 2-sorter, or <i>comparator</i> cell, can be used to construct <i*N*-sorters for arbitrary <i-N</i>, and the circuit in Figure 1 is a 4-sporter.Expand

This study attempts to explore significant features (curse of high dimensionality) in intrusion detection in order to be applied in data mining techniques resulting in faster training and testing process, less resource consumption as well as maintaining high detection rates.Expand

A sorting network for N items, or an N-sorter, is a circuit with inputs I = {i1, i2, ..., iN} and outputs O = {o1, o2, ..., oN}, such that O is a monotonically increasing permutation of I. Sorting… Expand

This paper describes how to construct [g,d] f-networks for arbitrary g,d, and considers a generalization of the divide-sort-merge strategy in which the N inputs are divided into g $\geq$ 2 disjoint groups that are sorted independently and then merged together.Expand

The minimum number of comparators S(N) required by an N-input sorting network is bounded below by S(N) ? N[log 2 (N) - 1] + 0(1), as a consequence of the theorem S(N) ? S(N - 1) + [log 2 (N)].