Sciweavers

59 search results - page 10 / 12
» Complexity of determining nonemptiness of the core
Sort
View
VLSISP
2002
93views more  VLSISP 2002»
13 years 6 months ago
Efficient VLSI Architectures for Multiuser Channel Estimation in Wireless Base-Station Receivers
Abstract. This paper presents a reduced-complexity, fixed-point algorithm and efficient real-time VLSI architectures for multiuser channel estimation, one of the core baseband proc...
Sridhar Rajagopal, Srikrishna Bhashyam, Joseph R. ...
NOMS
2010
IEEE
228views Communications» more  NOMS 2010»
13 years 4 months ago
DA VINCI: A tool to improve VoIP call routing configurations
As IP telephony becomes a critical part of the enterprise network infrastructure, there is an increasing need for tools to help manage VoIP systems. In this paper, we introduce DA ...
Kunwadee Sripanidkulchai, Shu Tao, Zon-Yin Shae
INFOCOM
2011
IEEE
12 years 10 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...
BMCBI
2005
95views more  BMCBI 2005»
13 years 7 months ago
Oligomeric protein structure networks: insights into protein-protein interactions
Background: Protein-protein association is essential for a variety of cellular processes and hence a large number of investigations are being carried out to understand the princip...
K. V. Brinda, Saraswathi Vishveshwara
INFOCOM
2000
IEEE
13 years 11 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura