3653 search results - page 206 / 731 » On Recognizable Timed Languages |
212
click to vote
JMLR
2012
13 years 7 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
153
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
149
click to vote
ISOLA
2010
Springer
15 years 3 months ago
2010
Springer
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
139
click to vote
COLING
2002
15 years 5 months ago
2002
In some contexts, well-formed natural language cannot be expected as input to information or communication systems. In these contexts, the use of grammar-independent input (sequen...
142
click to vote
TIME
2000
IEEE
15 years 9 months ago
2000
IEEE
We present a data model for movies and movie databases. A movie is considered to be a 2-dimensional semialgebraic figure that can change in time. We give a number of computabilit...