806 search results - page 92 / 162 » Lower Bounds on Correction Networks |
170
click to vote
INFOCOM
2008
IEEE
16 years 11 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
147
click to vote
SAC
2005
ACM
15 years 11 months ago
2005
ACM
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
170
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
193
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, the problem about power control in multiuser cognitive networks is addressed. The scenario we study is a heterogeneous network, where multiple cognitive (without the...
151
click to vote
CAAN
2006
Springer
15 years 9 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...