2254 search results - page 66 / 451 » Computing the minimal covering set |
CADE
2009
Springer
14 years 10 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
ECCV
2000
Springer
14 years 2 months ago
2000
Springer
This paper presents a new method to find minimal paths in 3D images, giving as initial data one or two endpoints. This is based on previous work [1] for extracting paths in 2D ima...
ECCV
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
APN
2010
Springer
13 years 10 months ago
2010
Springer
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
ECCV
1996
Springer
14 years 12 months ago
1996
Springer
We present a variational approachto dense stereo reconstructionwhich combines powerful tools such as regularization and multi-scale processing to estimate directly depth from a num...