8259 search results - page 292 / 1652 » On Generalized Feistel Networks |
112
click to vote
CORR
2007
Springer
15 years 28 days ago
2007
Springer
Abstract—This paper formulates and studies a general distributed field reconstruction problem using a dense network of noisy one-bit randomized scalar quantizers in the presence...
SIAMDM
2008
15 years 26 days ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
TSP
2008
15 years 25 days ago
2008
A new noncooperative eigencoding algorithm is introduced for MIMO Ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix a...
141
Voted
MOR
2007
15 years 14 days ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
103
click to vote
ICTAI
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper, we introduce a new partial consistency for constraint networks which is called Structural Consistency of level w and is denoted w-SC consistency. This consistency i...