2925 search results - page 37 / 585 » Information Complexity of Online Problems |
168
click to vote
IBPRIA
2007
Springer
15 years 9 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...
142
click to vote
DEXA
2008
Springer
15 years 7 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 ...
154
click to vote
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
143
click to vote
CJ
2010
15 years 6 months ago
2010
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...
174
click to vote
ICTA
2009
IEEE
16 years 17 days ago
2009
IEEE
1 WCAG 2.0 (W3C Recommendation 11 Dec. 2008) recommendation includes a specific guideline regarding the readability of text contents. This paper presents an approach to adapt text ...