441 search results - page 66 / 89 » Convex Graph Invariants |
AAAI
2010
13 years 9 months ago
2010
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
JMLR
2010
13 years 2 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
AFPAC
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...
CCCG
2003
13 years 9 months ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
SSPR
1998
Springer
13 years 11 months ago
1998
Springer
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...