412 search results - page 48 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
104
click to vote
ISPD
1998
ACM
15 years 4 months ago
1998
ACM
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
ITNG
2007
IEEE
15 years 6 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
STOC
1995
ACM
15 years 3 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
TWC
2008
14 years 11 months ago
2008
This letter considers multiple symbol differential detection for multiple-antenna systems over flat Ricean-fading channels when partial channel state information (CSI) is available...
102
click to vote
ICC
2008
IEEE
15 years 6 months ago
2008
IEEE
—We propose a simple power scheduling algorithm for relay channels with multiple antennas. The algorithm combines seamlessly with a low complexity communication protocol that emp...