11565 search results - page 1 / 2313 » Computing Minimal Mappings |
SEMWEB
2009
Springer
13 years 11 months ago
2009
Springer
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...
DAC
1992
ACM
13 years 9 months ago
1992
ACM
AWCC
2004
Springer
13 years 10 months ago
2004
Springer
FPGA
1995
ACM
13 years 8 months ago
1995
ACM
In this paper, we present an improvement of the FlowMap algorithm, named CutMap, which combines depth and area minimization in the mapping process by computing min-cost min-height...
DAC
1996
ACM
13 years 9 months ago
1996
ACM
Technology mapping requires the unmapped logic network to be represented in terms of base functions, usually two-input NORs and inverters. Technology decomposition is the step tha...