A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Edit Distance to Monotonicity in Sliding Windows
[chapter]
2011
Lecture Notes in Computer Science
Given a stream of items each associated with a numerical value, its edit distance to monotonicity is the minimum number of items to remove so that the remaining items are non-decreasing with respect to the numerical value. The space complexity of estimating the edit distance to monotonicity of a data stream is becoming well-understood over the past few years. Motivated by applications on network quality monitoring, we extend the study to estimating the edit distance to monotonicity of a sliding
doi:10.1007/978-3-642-25591-5_58
fatcat:5p3u52ztwjgl3mydyzpdtmomvi