11231 search results - page 1981 / 2247 » Digging for Data Structures |
122
Voted
EKAW
2006
Springer
15 years 7 months ago
2006
Springer
Existing ontology matching algorithms use a combination of lexical and structural correspondance between source and target ontologies. We present a realistic case-study where both ...
128
Voted
ENC
2006
IEEE
15 years 7 months ago
2006
IEEE
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
140
Voted
ESOP
2006
Springer
15 years 7 months ago
2006
Springer
Language-based information-flow analysis is promising in protecting data confidentiality. Although much work has been carried out in this area, relatively little has been done for ...
136
Voted
FPL
2006
Springer
15 years 7 months ago
2006
Springer
Many compute-intensive applications generate single result values by accessing clusters of nearby points in grids of one, two, or more dimensions. Often, the performance of FGPA i...
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Automatically assessing the value of bioavailability from the chemical structure of a molecule is a very important issue in biomedicine and pharmacology. In this paper, we present...