Pairwise Networks are Superior for Selection
نویسندگان
چکیده
This paper revisits the pairwise sorting network introduced by Parberry in the early 90’s. We provide a simple specification of the pairwise network which also clarifies its close resemblance to the more classic odd-even network introduced by Batcher in the mid 60’s. Finally we illustrate that pairwise networks are better suited than odd-even networks for the construction of selection networks.
منابع مشابه
Selection of Favorite Reusable Launch Vehicle Concepts by using the Method of Pairwise Comparison
The contribution of this paper to the space transportation system field is to select promising Reusable Launch Vehicle (RLV) concepts by using a formal evaluation procedure. The vehicle system is divided into design features. Every design feature can have alternative characteristics. All combinations of design features and characteristics are compared pairwise with each other. The innovation an...
متن کاملPairwise Cardinality Networks
We introduce pairwise cardinality networks, networks of comparators, derived from pairwise sorting networks, which express cardinality constraints. We show that pairwise cardinality networks are superior to the cardinality networks introduced in previous work which are derived from odd-even sorting networks. Our presentation identifies the precise relationship between odd-even and pairwise sort...
متن کاملConstraint Score: A new filter method for feature selection with pairwise constraints
Feature selection is an important preprocessing step in mining high-dimensional data. Generally, supervised feature selection methods with supervision information are superior to unsupervised ones without supervision information. In the literature, nearly all existing supervised feature selection methods use class labels as supervision information. In this paper, we propose to use another form ...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملAn efficient symmetric polynomial-based key establishment protocol for wireless sensor networks
An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not create significant overhead. To date, several key establishment schemes have been proposed. Some of these have appropriate connectivity and resistance against key exposure, ...
متن کامل