A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
Zhaoyin Jia, Andrew C. Gallagher, Yao-Jen Chang, T...
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
This paper presents an algorithm capable of real-time separation of foreground from background in monocular video sequences. Automatic segmentation of layers from colour/contrast ...
Antonio Criminisi, Geoffrey Cross, Andrew Blake, V...
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...