Sciweavers

3757 search results - page 331 / 752
» The overlap number of a graph
Sort
View
TC
1998
15 years 6 months ago
Optimal Elections in Faulty Loop Networks and Applications
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
Bernard Mans, Nicola Santoro
CVPR
2009
IEEE
17 years 1 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
ICDE
2002
IEEE
121views Database» more  ICDE 2002»
16 years 8 months ago
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
Sergey Melnik, Hector Garcia-Molina, Erhard Rahm
WWW
2006
ACM
16 years 7 months ago
Using graph matching techniques to wrap data from PDF documents
Wrapping is the process of navigating a data source, semiautomatically extracting data and transforming it into a form suitable for data processing applications. There are current...
Tamir Hassan, Robert Baumgartner
ICDAR
2009
IEEE
16 years 1 months ago
User-Guided Wrapping of PDF Documents Using Graph Matching Techniques
There are a number of established products on the market for wrapping—semi-automatic navigation and extraction of data—from web pages. These solutions make use of the inherent...
Tamir Hassan