412 search results - page 59 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
100
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
110
click to vote
EDBT
2004
ACM
15 years 12 months ago
2004
ACM
The mining of periodic patterns in time series databases is an interesting data mining problem that can be envisioned as a tool for forecasting and predicting the future behavior o...
FSTTCS
2008
Springer
15 years 25 days ago
2008
Springer
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...
115
click to vote
AUTOMATICA
2008
14 years 12 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...