Sciweavers

8259 search results - page 292 / 1652
» On Generalized Feistel Networks
Sort
View
195
Voted
CORR
2007
Springer
82views Education» more  CORR 2007»
15 years 6 months ago
One-bit Distributed Sensing and Coding for Field Estimation in Sensor Networks
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...
Ye Wang, Prakash Ishwar, Venkatesh Saligrama
SIAMDM
2008
139views more  SIAMDM 2008»
15 years 6 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
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...
Chandra Chekuri, F. Bruce Shepherd
TSP
2008
89views more  TSP 2008»
15 years 6 months ago
Noncooperative Eigencoding for MIMO Ad hoc Networks
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...
Duong A. Hoang, Ronald A. Iltis
MOR
2007
149views more  MOR 2007»
15 years 6 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
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 ...
Anupam Gupta, R. Ravi, Amitabh Sinha
ICTAI
2010
IEEE
15 years 4 months ago
A New Filtering Based on Decomposition of Constraint Sub-Networks
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...
Philippe Jégou, Cyril Terrioux