Sciweavers

5451 search results - page 60 / 1091
» Connectivity of a Gaussian network
Sort
View
JETAI
1998
110views more  JETAI 1998»
14 years 11 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
ICPP
1994
IEEE
15 years 4 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández
ICC
2009
IEEE
121views Communications» more  ICC 2009»
14 years 9 months ago
Throughput Scaling of Wireless Networks With Random Connections
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connec...
Shengshan Cui, Alexander M. Haimovich, Oren Somekh...
INFOCOM
2011
IEEE
14 years 3 months ago
Connectivity maintenance in mobile wireless networks via constrained mobility
—We explore distributed mechanisms for maintaining the physical layer connectivity of a mobile wireless network while still permitting significant area coverage. Moreover, we re...
Joshua Reich, Vishal Misra, Dan Rubenstein, Gil Zu...
PIMRC
2008
IEEE
15 years 6 months ago
Connectivity of wireless ad hoc networks with random beamforming: An analytical approach
Random beamforming, where each node selects a main beam direction without any coordination with other nodes, has been proposed as a simple technique to improve connectivity in wire...
Salman Durrani, Xiangyun Zhou, Haley M. Jones