We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequ...
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
This paper presents a system that can automatically recognize four different static human body postures in video sequences. The considered postures are standing, sitting, squattin...
This paper proposes a fast blotch detection algorithm based on a Markov Random Field (MRF) model with less computational load and with lower false alarm rate than the existing MRF...
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...