In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
The problem of Named Entity Generation is expressed as a conditional probability model over a structured domain. By defining a factor-graph model over the mentions of a text, we o...
The automatic allocation of enterprise workload to resources can be enhanced by being able to make `whatif' response time predictions, whilst different allocations are being c...
David A. Bacigalupo, Jano van Hemert, Asif Usmani,...
When attempting to code faces for modeling or recognition, estimates of dimensions are typically obtained from an ensemble. These tend to be significantly sub-optimal. Firstly, en...
Nicholas Costen, Timothy F. Cootes, Christopher J....
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...