1382 search results - page 11 / 277 » Formal Analysis of Online Algorithms |
ICDAR
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper presents a syntactic recognition approach for on-line drawn graphical symbols. The proposed method consists in an incremental on-line predictive parser based on symbol ...
TIT
2008
14 years 11 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...
DAGSTUHL
1996
15 years 1 months ago
1996
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
CJ
2008
14 years 11 months ago
2008
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
MFCS
1994
Springer
15 years 3 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...