3991 search results - page 210 / 799 » Bounding homogeneous models |
COLT
2001
Springer
14 years 24 days ago
2001
Springer
Abstract. We develop three new techniques to build on the recent advances in online learning with kernels. First, we show that an exponential speed-up in prediction time per trial ...
FORMATS
2007
Springer
14 years 2 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
TACAS
2007
Springer
14 years 2 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
NIPS
2008
13 years 9 months ago
2008
We present a simple new Monte Carlo algorithm for evaluating probabilities of observations in complex latent variable models, such as Deep Belief Networks. While the method is bas...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total...