504 search results - page 33 / 101 » Canonical Graph Shapes |
CAV
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
STOC
1990
ACM
14 years 1 months ago
1990
ACM
Quadratic residuosity and graph isomorphism are classic problems and the canonical examples of zero-knowledge languages. However, despite much research e ort, all previous zerokno...
ICIP
2005
IEEE
14 years 3 months ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
ICCV
1998
IEEE
14 years 11 months ago
1998
IEEE
Representing shapes is a signi cant problem for vision systems that must recognize or classify objects. We derive a representation for a given shape by investigating its self-simi...
CVPR
2005
IEEE
14 years 12 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...