3825 search results - page 401 / 765 » The Language of Time: A Reader |
254
click to vote
JMLR
2012
13 years 9 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...
215
click to vote
TON
2012
13 years 9 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
148
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
This paper introduces an adaptive architecture for presenting interactive timed media onto distributed networked devices. The interactive presentation is documented in StoryML, an...
179
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
157
click to vote
EDUTAINMENT
2009
Springer
16 years 1 months ago
2009
Springer
This paper addresses the issues of distributed interactions in a simulation based medial training environment, where a team of doctors, nurses and assistants are trained for handli...