Sciweavers

1521 search results - page 83 / 305
» Kernelized map matching
Sort
View
ICDE
2006
IEEE
143views Database» more  ICDE 2006»
14 years 2 months ago
Effectiveness Bounds for Non-Exhaustive Schema Matching Systems
Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human ef...
Marko Smiljanic, Maurice van Keulen, Willem Jonker
VLDB
2002
ACM
166views Database» more  VLDB 2002»
13 years 8 months ago
COMA - A System for Flexible Combination of Schema Matching Approaches
Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data source...
Hong Hai Do, Erhard Rahm
TAMC
2007
Springer
14 years 2 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley
EOR
2007
165views more  EOR 2007»
13 years 8 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang
WABI
2009
Springer
132views Bioinformatics» more  WABI 2009»
14 years 3 months ago
mpscan: Fast Localisation of Multiple Reads in Genomes
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
Eric Rivals, Leena Salmela, Petteri Kiiskinen, Pet...