Sciweavers

2621 search results - page 19 / 525
» Near orders and codes
Sort
View
INFOCOM
2000
IEEE
14 years 25 days ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
ICC
2007
IEEE
128views Communications» more  ICC 2007»
14 years 9 days ago
A Near Optimal Localized Heuristic for Voice Multicasting over Ad Hoc Wireless Networks
Abstract-- Providing real-time voice multicasting over multihop ad hoc wireless networks is a challenging task. The unique characteristics of voice traffic (viz. small packet size,...
G. Venkat Raju, Tamma Bheemarjuna Reddy, C. Siva R...
VSTTE
2005
Springer
14 years 1 months ago
Verifying Design with Proof Scores
: Verifying design instead of code can be an effective and practical approach to obtaining verified software. This paper argues that proof scores are an attractive method for ver...
Kokichi Futatsugi, Joseph A. Goguen, Kazuhiro Ogat...
VTC
2008
IEEE
159views Communications» more  VTC 2008»
14 years 2 months ago
Symbol Error Probability of Distributed-Alamouti Scheme in Wireless Relay Networks
—In this paper, we analyze the maximum likelihood decoding performance of non-regenerative cooperation employing Alamouti scheme. Specifically, we derive two closed-form express...
Trung Q. Duong, Dac-Binh Ha, Hoai-An Tran, Nguyen-...
JSAC
2008
106views more  JSAC 2008»
13 years 8 months ago
A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems
We consider large MIMO systems, where by `large' we mean number of transmit and receive antennas of the order of tens to hundreds. Such large MIMO systems will be of immense i...
K. Vishnu Vardhan, Saif K. Mohammed, Ananthanaraya...