4616 search results - page 138 / 924 » The Communication Complexity of Correlation |
139
click to vote
VTC
2008
IEEE
16 years 25 days 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...
185
click to vote
INFOCOM
1995
IEEE
15 years 10 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
190
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
181
click to vote
ICC
2007
IEEE
16 years 23 days ago
2007
IEEE
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
174
click to vote
INFOCOM
2007
IEEE
16 years 22 days ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...