Sciweavers

1972 search results - page 87 / 395
» connection 2008
Sort
View
99
Voted
DM
2007
113views more  DM 2007»
15 years 21 days ago
Counting labeled general cubic graphs
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinso...
83
Voted
TIT
2008
95views more  TIT 2008»
15 years 19 days 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ú
TIT
2008
81views more  TIT 2008»
15 years 19 days ago
Large Deviations of the Interference in a Wireless Communication Model
Interference from other users limits the capacity, and possibly the connectivity, of wireless networks. A simple model of a wireless ad-hoc network, in which node locations are des...
Ayalvadi J. Ganesh, Giovanni Luca Torrisi
106
Voted
CCR
2002
81views more  CCR 2002»
15 years 17 days ago
Rationalizing key design decisions in the ATM user plane
Any technology requires some number of key design decisions. In the case of the ATM user plane, the choices to use fixed length, 53 byte cells and virtual connections were unortho...
Daniel B. Grossman
66
Voted
DM
2000
115views more  DM 2000»
15 years 17 days ago
Dualizability and graph algebras
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is eith...
Brian A. Davey, Pawel M. Idziak, William A. Lampe,...