We address the continuous problem of assigning multiple (unordered) labels with the minimum perimeter. The corresponding discrete Potts model is typically addressed with a-expansion which can generate metrication artifacts. Existing convex continuous formulations of the Potts model use TV-based functionals directly encoding perimeter costs. Such formulations are analogous to ’min-cut’ problems ...

ABSTRACT Objective. Complex regional pain syndrome (CRPS) is a severe neuropathic pain state that is oftenObjective. Complex regional pain syndrome (CRPS) is a severe neuropathic pain state that is often disproportionate to the initial trauma. Associated features are autonomic dysregulation, swelling, motor dysfunction, and trophic changes to varying degrees. Despite a multitude of treatment mo...

We consider stochastic processes fX(t; ) : t 2 Tg with continuous parameter t 2 T = [0;1[. These processes are so called generalized supermartingales, where the generalization comes from a modification of the right side of the supermartingale inequality. The assumptions on the process and the probability space are the same as for the classical convergence theorem of DOOB (see KOPP [2]). The aim...

Computational models of trust typically assume that an assessment of the trustworthiness of an individual can be formed from learning from the outcomes of a sequence of atomic tasks, as well as other evidence such as reports from third parties. Further, they assume that an agent’s trustworthiness can be modelled by a single probability distribution. In this paper we explore alternative mechanis...

Motivated partly by the resurgence of neural computation research, and partly by advances in device technology, there has been a recent increase of interest in analog, continuous-time computation. However, while special-case algorithms and devices are being developed, relatively little work exists on the general theory of continuous-time models of computation. In this paper, we survey the exist...

Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the submodular set-function to a convex function, which opens up tools from convex optimization. Submodularity goes beyond set-functions and has naturally been ...

We address the issue of constructing continuous instantons representing the pair creation of black holes in a cosmological context. The recent attempt at constructing such solutions using virtual domain walls is reviewed first. We then explore the existence of continous instantons in higher curavature gravity theories where the Lagrangian is polynomial in the Ricci scalar. Lastly, we study cont...