Sciweavers

384 search results - page 31 / 77
» Equivalence Relations on Classes of Computable Structures
Sort
View
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...
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...
ITC
2003
IEEE
151views Hardware» more  ITC 2003»
14 years 1 months ago
Fault Collapsing via Functional Dominance
A fault fj is said to dominate another fault fi if all tests for fi detect fj . When two faults dominate each other, they are called equivalent. Dominance and equivalence relation...
Vishwani D. Agrawal, A. V. S. S. Prasad, Madhusuda...
CVPR
2008
IEEE
14 years 9 months ago
Statistical analysis on Stiefel and Grassmann manifolds with applications in computer vision
Many applications in computer vision and pattern recognition involve drawing inferences on certain manifoldvalued parameters. In order to develop accurate inference algorithms on ...
Pavan K. Turaga, Ashok Veeraraghavan, Rama Chellap...
TLCA
2009
Springer
14 years 2 months ago
Partial Orders, Event Structures and Linear Strategies
We introduce a Game Semantics where strategies are partial orders, and composition is a generalization of the merging of orders. Building on this, to bridge between Game Semantics ...
Claudia Faggian, Mauro Piccolo