Sciweavers

36 search results - page 4 / 8
» On the Relation between Sized-Types Based Termination and Se...
Sort
View
OTM
2005
Springer
14 years 1 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...
JODS
2007
119views Data Mining» more  JODS 2007»
13 years 7 months ago
Semantic Matching: Algorithms and Implementation
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
Fausto Giunchiglia, Mikalai Yatskevich, Pavel Shva...
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
KBS
2007
74views more  KBS 2007»
13 years 7 months ago
Representation and processing of information related to real world events
Event based analysis plays an important role in reducing the latency of information delivery in an event driven world. Also, the perception of an ‘event’ by a user is at a hig...
Aparna Nagargadde, V. Sridhar, Krithi Ramamritham
VLDB
2003
ACM
125views Database» more  VLDB 2003»
14 years 8 months ago
THESUS: Organizing Web document collections based on link semantics
Abstract. The requirements for effective search and management of the WWW are stronger than ever. Currently Web documents are classified based on their content not taking into acco...
Maria Halkidi, Benjamin Nguyen, Iraklis Varlamis, ...