Sciweavers

1357 search results - page 27 / 272
» Compositionality in Graph Transformation
Sort
View
CVPR
2009
IEEE
15 years 3 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu
TFM
2009
Springer
252views Formal Methods» more  TFM 2009»
14 years 3 months ago
Abstraction and Modelling: A Complementary Partnership
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
Jeffrey Kramer
VC
1998
106views more  VC 1998»
13 years 8 months ago
Polyhedron realization for shape transformation
Polyhedron realization is the transformation of a polyhedron into a convex polyhedron with an isomorphic vertex neighborhood graph. We present in this paper a novel algorithm for ...
Avner Shapiro, Ayellet Tal
APPML
2004
79views more  APPML 2004»
13 years 8 months ago
Distance regularity of compositions of graphs
We study preservation of distance regularity when taking strong sums and strong products of distance-regular graphs. MSC 2000 Classification: 05C12
Dragan Stevanovic
JOT
2010
115views more  JOT 2010»
13 years 3 months ago
A Rule-Driven Approach for composing Viewpoint-oriented Models
Model composition is a crucial activity in Model Driven Engineering (MDE). It is particularly useful when adopting a multi-modeling approach to analyze and design software systems...
Adil Anwar, Sophie Ebersold, Bernard Coulette, Mah...