either explicitly, by classification of prespecified windows, or implicitly by classification of subsets of spatial features collected from the image as a whole. The third strategy is a hybrid of the first two, employing dissection together with recombination rules to define potential segments, but using

Consider a complete directed graph in which each arc has a given length. There is a set ofjobs, each job i located at some node of the graph, with an associated processing time hi, and whose execution has to start within a prespecified time window [r;, di]. We have a single server that can move

How to control hand-off drops is a very important Qualityof -Service (QoS) issue in cellular networks. In order to keep the hand-off dropping probability below a pre-specified target value (thus providing a probabilistic QoS guarantee), we design and evaluate predictive and adaptive schemes

STAGGER: a one-pass, online and incremental algorithm for mining periodic patterns in data streams. STAGGER does not require that the user pre-specify the periodicity rate of the data. Instead, STAGGER discovers the potential periodicity rates. STAGGER maintains multiple expanding sliding windows

Abstract—We propose an efficient Frequent Sequence Stream algorithm for identifying the top k most frequent subsequences over big data streams. Our Sequence Stream algorithm gains its efficiency by its time complexity of linear time and very limited space complexity. With a pre-specified

are then classified. The operation of attempting to decompose the image into classifiable units is called "dissection. " The second class of methods avoids dissection, and segments the image either explicitly, by classification of prespecified windows, or implicitly by classification of subsets of spatial

STAGGER: a one-pass, online and incremental algorithm for mining periodic patterns in data streams. STAGGER does not require that the user pre-specify the periodicity rate of the data. Instead, STAGGER discovers the potential periodicity rates. STAGGER maintains multiple expanding sliding windows

Traffic-smoothing for delivery of online VBR media is one of the most important problems in designing streaming multimedia applications. Given the available client buffer b and playback delay D, [21] introduces a window-based approach called SLWIN(k) to smooth online generated traffic for the pre-specified

We consider a general mesh network with multiple traffic streams subject to window flow control on a per hop, per stream basis. Scheduling at each server is governed by "service curve" requirements. We establish lower bounds on the window sizes such that each stream receives pre-specified

on the occupa-tion time outside of the range. Delayed double-barrier options are extin-guished when the occupation time outside of the range exceeds a prespecified knock-out window (delayed knockout). These contract designs are proposed as alternatives to the currently traded double-barrier options. They alleviate