412 search results - page 20 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
FTCS
1997
15 years 1 months ago
1997
A common problem in the operation of mission critical control systems is that of determining the future value of a physical quantity based upon past measurements of it or of relat...
103
click to vote
ECRTS
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
106
click to vote
VTC
2007
IEEE
15 years 6 months ago
2007
IEEE
— With the continuing downscaling of microelectronic technology, chip reliability becomes a great threat to the design of future complex microelectronic systems. Hence increasing...
139
click to vote
JMLR
2010
14 years 6 months ago
2010
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...