9949 search results - page 110 / 1990 » On the Network Complexity of Selection |
GLOBECOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtai...
ALGORITHMICA
2000
13 years 8 months ago
2000
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
ICIP
2008
IEEE
14 years 10 months ago
2008
IEEE
Due to the dynamic nature of cognitive radio networks, multi-user video streaming (with various video traffic characteristics and QoS requirements) requires efficient dynamic chan...
IPPS
2006
IEEE
14 years 3 months ago
2006
IEEE
Selective forwarding attacks may corrupt some missioncritical applications such as military surveillance and forest fire monitoring. In these attacks, malicious nodes behave like...
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
— In most wireless relay networks, the source and relay nodes transmit successively via fixed time division (FTD) and each relay forwards a packet immediately upon receiving. In...