11381 search results - page 1873 / 2277 » Connectivity |
170
click to vote
TCOM
2010
15 years 5 months ago
2010
Abstract—In this paper, we propose a spectrally efficient cooperative transmission protocol for multiple access scenarios. The key feature is to utilize multi-user diversity and...
198
click to vote
TCS
2010
15 years 5 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
169
click to vote
TCS
2010
15 years 5 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
190
Voted
TCS
2010
15 years 5 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
167
click to vote
TELSYS
2010
15 years 5 months ago
2010
In heterogeneous network environments, the network connections of a multi-homed device may have significant bandwidth differential. For a multihomed transmission protocol designed ...