Sciweavers

110 search results - page 6 / 22
» A Self-Routing Permutation Network
Sort
View
ICANN
2011
Springer
12 years 11 months ago
Bias of Importance Measures for Multi-valued Attributes and Solutions
Attribute importance measures for supervised learning are important for improving both learning accuracy and interpretability. However, it is well-known there could be bias when th...
Houtao Deng, George C. Runger, Eugene Tuv
ESA
1998
Springer
95views Algorithms» more  ESA 1998»
13 years 12 months ago
New Bounds for Oblivious Mesh Routing
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
ICPP
1999
IEEE
13 years 12 months ago
The Index-Permutation Graph Model for Hierarchical Interconnection Networks
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...
Chi-Hsiang Yeh, Behrooz Parhami
ISPAN
1997
IEEE
13 years 11 months ago
On The Shuffle-Exchange Permutation Network
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
Douglas W. Bass, Ivan Hal Sudborough
TIFS
2008
154views more  TIFS 2008»
13 years 7 months ago
On the Distinguishability of Distance-Bounded Permutations in Ordered Channels
Ordered channels, such as those provided by Internet protocol and transmission control protocol protocols, rely on sequence numbers to recover from packet reordering due to network...
Juan M. Estévez-Tapiador, Julio Césa...