Sciweavers

137 search results - page 2 / 28
» Privacy-Preserving Schema Matching Using Mutual Information
Sort
View
EDBT
2004
ACM
234views Database» more  EDBT 2004»
14 years 5 months ago
A Condensation Approach to Privacy Preserving Data Mining
In recent years, privacy preserving data mining has become an important problem because of the large amount of personal data which is tracked by many business applications. In many...
Charu C. Aggarwal, Philip S. Yu
CCS
2007
ACM
13 years 11 months ago
Privacy preserving error resilient dna searching through oblivious automata
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...
Juan Ramón Troncoso-Pastoriza, Stefan Katze...
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 5 months ago
On Schema Matching with Opaque Column Names and Data Values
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
Jaewoo Kang, Jeffrey F. Naughton
ICPR
2004
IEEE
14 years 6 months ago
A Graph-Based Approach to Corner Matching Using Mutual Information as a Local Similarity Measure
Corner matching constitutes a fundamental vision problem that serves as a building block of several important applications. The common approach to dealing with this problem starts...
Manolis I. A. Lourakis, Antonis A. Argyros, Kostas...
BTW
2007
Springer
212views Database» more  BTW 2007»
13 years 11 months ago
Instance Matching with COMA++
: Schema matching is the process of identifying semantic correspondences between schemas. COMA++ is a matching prototype which uses several characteristics of schemas to determine ...
Daniel Engmann, Sabine Maßmann