Sciweavers

5607 search results - page 184 / 1122
» Graph structure in the Web
Sort
View
SPIRE
1999
Springer
15 years 10 months ago
Top-down Extraction of Semi-Structured Data
In this paper, we propose an innovative approach to extracting semi-structured data from Web sources. The idea is to collect a couple of example objects from the user and to use t...
Berthier A. Ribeiro-Neto, Alberto H. F. Laender, A...
ICCS
2010
Springer
15 years 4 months ago
Translations between RDF(S) and Conceptual Graphs
Though similarities between the Semantic Web language RDF(S) and languages of the Conceptual Graphs family have often been pointed out, the differences between these formalisms hav...
Jean-François Baget, Madalina Croitoru, Ala...
158
Voted
ICPR
2006
IEEE
16 years 7 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu
ICPR
2002
IEEE
16 years 7 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
STACS
2009
Springer
16 years 1 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...