4541 search results - page 770 / 909 » Cache-Oblivious Algorithms and Data Structures |
169
click to vote
EKAW
2006
Springer
15 years 10 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 ...
165
click to vote
ENC
2006
IEEE
15 years 10 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...
197
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
180
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
222
click to vote
AMFG
2005
IEEE
15 years 8 months ago
2005
IEEE
Non-rigid 3D shape recovery is an inherently ambiguous problem. Given a specific rigid motion, different non-rigid shapes can be found that fit the measurements. To solve this am...