We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Abstract— In this paper, we consider a discrete-time stochastic system, where sensor measurements are sent over a network to the controller. The design objective is a non-classic...
Abstract. Robust foreground object segmentation via background modelling is a difficult problem in cluttered environments, where obtaining a clear view of the background to model i...
Vikas Reddy, Conrad Sanderson, Andres Sanin, Brian...
Abstract. We aim to provide information hiding support in concurrent object-oriented programming languages. We study the issue both at the object level and class level, in the cont...