Sciweavers

1056 search results - page 56 / 212
» Constraint-Based Graph Matching
Sort
View
RSA
2002
87views more  RSA 2002»
13 years 8 months ago
Inexpensive d-dimensional matchings
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
13 years 24 days ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
CVPR
2007
IEEE
14 years 11 months ago
An MRF and Gaussian Curvature Based Shape Representation for Shape Matching
Matching and registration of shapes is a key issue in Computer Vision, Pattern Recognition, and Medical Image Analysis. This paper presents a shape representation framework based ...
Pengdong Xiao, Nick Barnes, Tibério S. Caet...
ENTCS
2008
100views more  ENTCS 2008»
13 years 9 months ago
Implementing an EJB3-Specific Graph Transformation Plugin by Using Database Independent Queries
The current paper presents a novel approach to implement a graph transformation engine as an EJB3-specific plugin by using EJB QL queries for pattern matching. The essence of the ...
Gergely Varró
JCT
2007
90views more  JCT 2007»
13 years 9 months ago
Enumeration problems for classes of self-similar graphs
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
Elmar Teufl, Stephan Wagner