Sciweavers

29908 search results - page 155 / 5982
» On the complexity of communication complexity
Sort
View
INFOCOM
2005
IEEE
16 years 1 days ago
Credit based fair scheduling for packet switched networks
With the rapid development of Internet multimedia applications, the next generation of networks is required to schedule not only the best effort traffic but also the traffic wit...
Deng Pan, Yuanyuan Yang
VTC
2008
IEEE
236views Communications» more  VTC 2008»
16 years 25 days ago
Apriori-LLR-Threshold-Assisted K-Best Sphere Detection for MIMO Channels
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo
IPL
2006
141views more  IPL 2006»
15 years 6 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
FORTE
2008
15 years 8 months ago
Protocol Modeling with Model Program Composition
Designing and interoperability testing of distributed, application-level network protocols is complex. Windows, for example, supports currently more than 200 protocols, ranging fro...
Margus Veanes, Wolfram Schulte
ICC
2007
IEEE
134views Communications» more  ICC 2007»
16 years 24 days ago
DVB Detector for Cognitive Radio
—Cognitive radio (CR) is seen as one of the revolutionary techniques for future spectrum utilization. The first and probably the most challenging task for CR is to detect/sense t...
Loo Peng Goh, Zhongding Lei, Francois P. S. Chin