130 search results - page 11 / 26 » Online Prediction of the Running Time of Tasks |
179
click to vote
CPM
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
171
click to vote
SPE
1998
15 years 5 months ago
1998
This paper describes some basic experiments to see how fast various popular scripting and user-interface languages run on a spectrum of representative tasks. We found enormous var...
171
click to vote
ISMAR
2009
IEEE
16 years 20 days ago
2009
IEEE
Augmented reality applications often rely on a detailed environment model to support features such as annotation and occlusion. Usually, such a model is constructed offline, whic...
188
click to vote
CSMR
2007
IEEE
16 years 11 days ago
2007
IEEE
A dynamic object process graph is a view on the control flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for...
150
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper presents a novel approach to predict the Internet end-to-end delay using multiple-model (MM) methods. The basic idea of the MM method is to assume the system dynamics c...