Sciweavers

5105 search results - page 49 / 1021
» Approximate Structural Consistency
Sort
View
FOCS
2009
IEEE
15 years 6 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
ICDT
2007
ACM
118views Database» more  ICDT 2007»
15 years 3 months ago
Approximate Data Exchange
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
Michel de Rougemont, Adrien Vieilleribière
DBPL
2005
Springer
130views Database» more  DBPL 2005»
15 years 5 months ago
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
IS
2008
14 years 11 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
EWSN
2004
Springer
15 years 5 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...