376 search results - page 17 / 76 » On the Advice Complexity of Online Problems |
ACTA
1998
14 years 11 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
ICIP
2007
IEEE
15 years 6 months ago
2007
IEEE
Online target tracking requires to solve two problems: data association and online dynamic estimation. Usually, association effectiveness is based on prior information and observa...
WAOA
2004
Springer
15 years 5 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
107
click to vote
IBPRIA
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we address the problem of on-line recognition of human activities taking place in a public area such as a shopping center. We consider standard activities; namely, en...
DEXA
2008
Springer
15 years 1 months ago
2008
Springer
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...