380 search results - page 18 / 76 » Instance Matching with COMA |
SIGECOM
2010
ACM
13 years 6 months ago
2010
ACM
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Schema matching is the problem of finding correspondences (mapping rules, e.g. logical formulae) between heterogeneous schemas e.g. in the data exchange domain, or for distribute...
ICTCS
2001
Springer
14 years 2 days ago
2001
Springer
In [BCC00], we presented a general framework for extending calculi of mobile agents with object-oriented features, and we studied a typed instance of that model based on Cardelli a...
CASES
2001
ACM
13 years 11 months ago
2001
ACM
We describe a digital circuit synthesis algorithm specialized for the domain of pattern matching circuits implemented in reconfigurable logic. We propose to use this algorithm as ...
TCAD
2008
13 years 7 months ago
2008
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...