Sciweavers

51 search results - page 2 / 11
» Implementation of a Swap Matching Algorithm Using a Graph Th...
Sort
View
IBIS
2006
109views more  IBIS 2006»
13 years 5 months ago
Formulation Schema Matching Problem for Combinatorial Optimization Problem
: 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 ...
Zhi Zhang, Pengfei Shi, Haoyang Che, Yong Sun, Jun...
ICML
2006
IEEE
14 years 6 months ago
Graph model selection using maximum likelihood
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...
Adam Kalai, Ivona Bezáková, Rahul Sa...
XSYM
2009
Springer
264views Database» more  XSYM 2009»
13 years 11 months ago
From Entity Relationship to XML Schema: A Graph-Theoretic Approach
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...
Massimo Franceschet, Donatella Gubiani, Angelo Mon...
CVPR
2010
IEEE
14 years 1 months ago
Dense Non-rigid Surface Registration Using High-Order Graph Matching
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...
Yun Zeng, Chaohui Wang, Yang Wang, Xianfeng Gu, Di...
FOCS
2003
IEEE
13 years 10 months ago
Switch Scheduling via Randomized Edge Coloring
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...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...