254 search results - page 15 / 51 » On randomized one-round communication complexity |
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
In a wide range of communication systems, including DS-CDMA and OFDM systems, the signal-of-interest might be corrupted by an improper [1] (also called non circularly symmetric [2...
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
VTC
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, low complexity acquisition of UWB telemetry data packets is addressed. In addition to the usual channel impairments considered of additive white Gaussian noise (A...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— In this paper, we propose an unequal error protection (UEP) framework for progressive image transmission over wireless networks with both random errors and packet loss....