Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
In this paper we present a novel performance analysis technique for large-scale systems modelled in the stochastic process algebra PEPA. In contrast to the well-known approach of ...
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Stochastic transparency provides a unified approach to orderindependent transparency, anti-aliasing, and deep shadow maps. It augments screen-door transparency using a random sub...
Eric Enderton, Erik Sintorn, Peter Shirley, David ...
Abstract—We introduce an extended family of continuous-domain stochastic models for sparse, piecewise-smooth signals. These are specified as solutions of stochastic differential...