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

December 03, 2019 ยท The Ethereal ยท ๐Ÿ› arXiv.org

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Nicolas Beldiceanu, Mats Carlsson, Claude-Guy Quimper, Maria-Isabel Restrepo-Ruiz arXiv ID 1912.01532 Category cs.FL: Formal Languages Cross-listed cs.AI Citations 1 Venue arXiv.org Last Checked 2 months ago
Abstract
Given, a sequence $\mathcal{X}$ of $n$ 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 $\mathcal{X}$ of $m$ consecutive variables, we describe a $ฮ˜(n)$ time complexity checker, as well as a $ฮ˜(n)$ space complexity reformulation for such sliding constraint.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Formal Languages