701 search results - page 16 / 141 » Self Bounding Learning Algorithms |
UAI
2003
13 years 9 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
AAAI
2008
13 years 10 months ago
2008
Modern Bayesian Network learning algorithms are timeefficient, scalable and produce high-quality models; these algorithms feature prominently in decision support model development...
INFOCOM
1996
IEEE
13 years 11 months ago
1996
IEEE
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...
TIT
2008
13 years 7 months ago
2008
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
ICALT
2003
IEEE
14 years 25 days ago
2003
IEEE
Algorithms and Programming Languages is a core subject in the BS Degree in Mathematics at the authors’ university. Some of the students are very interested in computer programmi...