Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
The wavelet transform hierarchically decomposes images with prescribed bases, while multilineal models search for optimal bases to adapt visual data. In this paper, we integrate t...