412 search results - page 16 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
APAQS
2000
IEEE
15 years 4 months ago
2000
IEEE
The use of the statistical technique of mixture model analysis as a tool for early prediction of fault-prone program modules is investigated. The Expectation-Maximum likelihood (E...
124
click to vote
AAAI
2012
13 years 2 months ago
2012
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
DATE
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper is concerned with solar driven sensors deployed in an outdoor environment. We present feedback controllers which adapt parameters of the application such that a maximal...
117
click to vote
INFOCOM
2000
IEEE
15 years 3 months ago
2000
IEEE
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...