Sciweavers

16 search results - page 2 / 4
» Discovering and Explaining Abnormal Nodes in Semantic Graphs
Sort
View
ESWS
2005
Springer
13 years 10 months ago
Web Explanations for Semantic Heterogeneity Discovery
Managing semantic heterogeneity is a complex task. One solution involves matching like terms to each other. We view Match as an operator that takes two graph-like structures (e.g....
Pavel Shvaiko, Fausto Giunchiglia, Paulo Pinheiro ...
ESWS
2004
Springer
13 years 10 months ago
S-Match: an Algorithm and an Implementation of Semantic Matching
Abstract. We think of Match as an operator which takes two graph-like structures and produces a mapping between those nodes of the two graphs that correspond semantically to each o...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
LREC
2010
199views Education» more  LREC 2010»
13 years 6 months ago
Building a Cross-lingual Relatedness Thesaurus using a Graph Similarity Measure
The Internet is an ever growing source of information stored in documents of different languages. Hence, cross-lingual resources are needed for more and more NLP applications. Thi...
Lukas Michelbacher, Florian Laws, Beate Dorow, Ulr...
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 4 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
OTM
2005
Springer
13 years 10 months ago
Semantic Schema Matching
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...