Sciweavers

101 search results - page 1 / 21
» Automating the approximate record-matching process
Sort
View
ISCI
2000
84views more  ISCI 2000»
13 years 4 months ago
Automating the approximate record-matching process
Data Quality has many dimensions one of which is accuracy. Accuracy is usually compromised by errors accidentally or intensionally introduced in a database system. These errors re...
Vassilios S. Verykios, Ahmed K. Elmagarmid, Elias ...
DGO
2004
111views Education» more  DGO 2004»
13 years 6 months ago
A Web Based Tool for an Automated Dental Identification System (ADIS)
We present a web-based environment for the Automated Dental Identification System (ADIS). This system is designed for identification missing, unidentified and wanted persons based...
Gamal Fahmy, Diaa Eldin M. Nassar, Eyad Jai-Said, ...
IADIS
2004
13 years 6 months ago
A Scheme for Approximate Matching Event Announcements to a Customer Database
An event is a short and data-rich document and it refers to an instance of an announcement type such as "wedding", "birth", "graduation", "aucti...
Ray R. Hashemi, John R. Talburt
CSL
2006
Springer
13 years 8 months ago
Weak Bisimulation Approximants
Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached
Will Harwood, Faron Moller, Anton Setzer
LICS
2003
IEEE
13 years 10 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais