English

Classifying Pattern and Feature Properties to Get a $\Theta(n)$ Checker and Reformulation for Sliding Time-Series Constraints

Formal Languages and Automata Theory 2019-12-04 v1 Artificial Intelligence

Abstract

Given, a sequence X\mathcal{X} of nn variables, a time-series constraint ctr using the Sum aggregator, and a sliding time-series constraint enforcing the constraint ctr on each sliding window of X\mathcal{X} of mm consecutive variables, we describe a Θ(n)\Theta(n) time complexity checker, as well as a Θ(n)\Theta(n) space complexity reformulation for such sliding constraint.

Keywords

Cite

@article{arxiv.1912.01532,
  title  = {Classifying Pattern and Feature Properties to Get a $\Theta(n)$ Checker and Reformulation for Sliding Time-Series Constraints},
  author = {Nicolas Beldiceanu and Mats Carlsson and Claude-Guy Quimper and Maria-Isabel Restrepo-Ruiz},
  journal= {arXiv preprint arXiv:1912.01532},
  year   = {2019}
}

Comments

47 pages, 5 figures, 5 tables