We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
This paper is devoted to piecewise-constant segmentation of images using a curve evolution approach in a variational formulation. The problem to be solved is also called the minima...
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
A fundamental problem in depth from defocus is the measurement of relative defocus between images. We propose a class of broadband operators that, when used together, provide inva...
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng