Sciweavers

97 search results - page 10 / 20
» Conditional Functional Dependencies for Data Cleaning
Sort
View
ADCM
1999
49views more  ADCM 1999»
14 years 9 months ago
Dyadic Hermite interpolation on a rectangular mesh
: Given f and rf at the vertices of a rectangular mesh, we build an interpolating function f by a subdivision algorithm. The construction on each elementary rectangle is independen...
Serge Dubuc, Jean-Louis Merrien
TIT
1998
96views more  TIT 1998»
14 years 9 months ago
Sequential Prediction of Individual Sequences Under General Loss Functions
Abstract— We consider adaptive sequential prediction of arbitrary binary sequences when the performance is evaluated using a general loss function. The goal is to predict on each...
David Haussler, Jyrki Kivinen, Manfred K. Warmuth
ICDE
2010
IEEE
311views Database» more  ICDE 2010»
15 years 6 months ago
Detecting Inconsistencies in Distributed Data
— One of the central problems for data quality is inconsistency detection. Given a database D and a set Σ of dependencies as data quality rules, we want to identify tuples in D ...
Wenfei Fan, Floris Geerts, Shuai Ma, Heiko Mü...
QSIC
2006
IEEE
15 years 3 months ago
Static Slicing for Pervasive Programs
Pervasive programs should be context-aware, which means that program functions should react according to changing environmental conditions. Slicing, as an important class of code ...
Heng Lu, W. K. Chan, T. H. Tse
FOIKS
2008
Springer
14 years 11 months ago
Lossless Decompositions in Complex-Valued Databases
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
Henning Köhler, Sebastian Link