412 search results - page 8 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...
TCOM
2008
14 years 9 months ago
2008
: Due to correlated fading in frequency hopping (FH) wireless communication systems, it is possible to predict the future channel state information (CSI) for one frequency based on...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
This paper presents an algorithm to bound the bandwidth of a Web crawler. The crawler collects statistics on the transfer rate of each server to predict the expected bandwidth use...
NIPS
2004
14 years 11 months ago
2004
In the context of binary classification, we define disagreement as a measure of how often two independently-trained models differ in their classification of unlabeled data. We exp...
100
click to vote
ECCC
2011
14 years 4 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...