314 search results - page 3 / 63 » Formulation Schema Matching Problem for Combinatorial Optimi... |
WEBI
2005
Springer
13 years 10 months ago
2005
Springer
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
WAIM
2005
Springer
13 years 10 months ago
2005
Springer
It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms....
CVPR
2005
IEEE
14 years 6 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
PPSN
2004
Springer
13 years 10 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
DISOPT
2007
13 years 4 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...