We study algorithms for the sliding-window model, an important variant of data-stream in which goal is to compute some function a fixed-length suffix stream. extend smooth-histogram framework Braverman and Ostrovsky (FOCS 2007) almost-smooth functions, includes all subadditive functions. Specifically, we show that if can be \(\left( 1+{{\varepsilon }}\right) \)-approximated insertion-only strea...

Content Defined Chunking (CDC) is an important component in data deduplication, which affects both the deduplication ratio as well as deduplication performance. The sliding-window-based CDC algorithm and its variants have been the most popular CDC algorithms for the last 15 years. However, their performance is limited in certain application scenarios since they have to slide byte by byte. The a...

As mentioned in Section 4 of main paper, the intricate relational and temporal dependencies between data points in our setting limits our ability to efficiently train by decomposing events into independent sequences. To address this challenge, we design an efficient Global BPTT algorithm presented below. During each step of training, we build computational graph using consecutive events in the ...

In this paper, we propose a system for contextual and semantic Arabic documents classification by improving the standard fuzzy model. Indeed, promoting neighborhood semantic terms that seems absent in this model by using a radial basis modeling. In order to identify the relevant documents to the query. This approach calculates the similarity between related terms by determining the relevance of...