Sciweavers

5451 search results - page 133 / 1091
» Connectivity of a Gaussian network
Sort
View
JAL
2002
71views more  JAL 2002»
15 years 6 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...
TIT
2008
95views more  TIT 2008»
15 years 6 months ago
Mutual Information and Conditional Mean Estimation in Poisson Channels
Abstract--Following the discovery of a fundamental connection between information measures and estimation measures in Gaussian channels, this paper explores the counterpart of thos...
Dongning Guo, Shlomo Shamai, Sergio Verdú
AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
16 years 12 days ago
Connected Set Cover Problem and Its Applications
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
Tianping Shuai, Xiao-Dong Hu
ICANNGA
2009
Springer
141views Algorithms» more  ICANNGA 2009»
15 years 11 months ago
Connection Strategies in Associative Memory Models with Spiking and Non-spiking Neurons
The problem we address in this paper is that of finding effective and parsimonious patterns of connectivity in sparse associative memories. This problem must be addressed in real n...
Weiliang Chen, Reinoud Maex, Rod Adams, Volker Ste...
ALGORITHMICA
2002
71views more  ALGORITHMICA 2002»
15 years 6 months ago
Routing Flow Through a Strongly Connected Graph
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
Thomas Erlebach, Torben Hagerup