Sciweavers

4962 search results - page 653 / 993
» Connectivity in Sub-Poisson Networks
Sort
View
IPPS
1996
IEEE
15 years 11 months ago
Partitionability of the Multistage Interconnection Networks
- Partitionability allows the creation of many physically independent subsystems, each of which retains an identical functionality as its parent network and has no communication in...
Yeimkuan Chang
IPCO
1993
138views Optimization» more  IPCO 1993»
15 years 8 months ago
An efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
Harold N. Gabow, Michel X. Goemans, David P. Willi...
ICASSP
2010
IEEE
15 years 7 months ago
Guaranteed robust distributed estimation in a network of sensors
This paper proposes a guaranteed robust bounded-error distributed estimation algorithm. It may be employed to perform parameter estimation from data collected in a network of wire...
Jean-Benoist Leger, Michel Kieffer
AMC
2008
99views more  AMC 2008»
15 years 6 months ago
Markov chain network training and conservation law approximations: Linking microscopic and macroscopic models for evolution
In this paper, a general framework for the analysis of a connection between the training of artificial neural networks via the dynamics of Markov chains and the approximation of c...
Roderick V. N. Melnik
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications
Abstract—In wireless networks with random node distribution, the underlying point process model and the channel fading process are usually considered separately. A unified frame...
Martin Haenggi