2254 search results - page 20 / 451 » Computing the minimal covering set |
144
click to vote
JGAA
2006
15 years 4 months ago
2006
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...
152
click to vote
EMMCVPR
2005
Springer
15 years 10 months ago
2005
Springer
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...
134
click to vote
MICS
2010
15 years 2 months ago
2010
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...
132
click to vote
CVPR
1996
IEEE
16 years 6 months ago
1996
IEEE
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...
123
click to vote
JCT
2002
15 years 4 months ago
2002
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...