Sciweavers

8259 search results - page 40 / 1652
» On Generalized Feistel Networks
Sort
View
TNN
1998
123views more  TNN 1998»
13 years 8 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
COMSNETS
2012
176views more  COMSNETS 2012»
12 years 4 months ago
Capacity of Byzantine consensus in capacity limited point-to-point networks
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...
Guanfeng Liang, Nitin H. Vaidya
ISNN
2010
Springer
13 years 7 months ago
Extension of the Generalization Complexity Measure to Real Valued Input Data Sets
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...
Iván Gómez, Leonardo Franco, Jos&eac...
TMC
2010
196views more  TMC 2010»
13 years 7 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
Mahmoud Al-Ayyoub, Himanshu Gupta
SIAMDM
2000
103views more  SIAMDM 2000»
13 years 8 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman