Sciweavers

504 search results - page 17 / 101
» Canonical Graph Shapes
Sort
View
SEFM
2005
IEEE
14 years 2 months ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier
STACS
2010
Springer
14 years 3 months ago
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
Bireswar Das, Jacobo Torán, Fabian Wagner
JAPLL
2010
85views more  JAPLL 2010»
13 years 3 months ago
Hybrid logic with the difference modality for generalisations of graphs
We discuss recent work generalising the basic hybrid logic with the difference modality to any reasonable notion of transition. This applies equally to both subrelational transiti...
Robert S. R. Myers, Dirk Pattinson
SMA
1999
ACM
106views Solid Modeling» more  SMA 1999»
14 years 27 days ago
Resolving non-uniqueness in design feature histories
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
Vincent A. Cicirello, William C. Regli
CVPR
2008
IEEE
14 years 10 months ago
Face shape recovery from a single image using CCA mapping between tensor spaces
In this paper, we propose a new approach for face shape recovery from a single image. A single near infrared (NIR) image is used as the input, and a mapping from the NIR tensor sp...
Zhen Lei, Qinqun Bai, Ran He, Stan Z. Li