51 search results - page 2 / 11 » Implementation of a Swap Matching Algorithm Using a Graph Th... |
129
Voted
IBIS
2006
15 years 2 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
116
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
141
Voted
XSYM
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constr...
134
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, we propose a high-order graph matching formulation to address non-rigid surface matching. The singleton terms capture the geometric and appearance similarities (e.g...
116
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...