412 search results - page 18 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
VALUETOOLS
2006
ACM
15 years 5 months ago
2006
ACM
Run-time management of modern Web-based services requires the integration of several algorithms and mechanisms for job dispatching, load sharing, admission control, overload detec...
104
click to vote
ICML
2004
IEEE
15 years 5 months ago
2004
IEEE
While there is a lot of empirical evidence showing that traditional rule learning approaches work well in practice, it is nearly impossible to derive analytical results about thei...
113
click to vote
TCOM
2010
14 years 10 months ago
2010
In this paper we formally analyze the interleaver and code design for QAM-based BICM transmissions using the binary reflected Gray code. We develop analytical bounds on the bit e...
106
click to vote
SIAMMAX
2011
14 years 6 months ago
2011
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...