Sciweavers

192 search results - page 7 / 39
» Using SAT-Solvers to Compute Inference-Proof Database Instan...
Sort
View
PSD
2010
Springer
109views Database» more  PSD 2010»
14 years 8 months ago
A Tool for Analyzing and Fixing Infeasible RCTA Instances
Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be...
Jordi Castro, José A. González
CINQ
2004
Springer
123views Database» more  CINQ 2004»
15 years 2 months ago
One-Sided Instance-Based Boundary Sets
Abstract. Instance retraction is a difficult problem for concept learning by version spaces. This chapter introduces a family of version-space representations called one-sided inst...
Evgueni N. Smirnov, Ida G. Sprinkhuizen-Kuyper, H....
DEXA
2010
Springer
180views Database» more  DEXA 2010»
14 years 10 months ago
Identifying Interesting Instances for Probabilistic Skylines
Significant research efforts have recently been dedicated to modeling and querying uncertain data. In this paper, we focus on skyline analysis of uncertain data, modeled as uncert...
Yinian Qi, Mikhail J. Atallah
ADBIS
2009
Springer
143views Database» more  ADBIS 2009»
15 years 4 months ago
Cost-Based Vectorization of Instance-Based Integration Processes
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
Matthias Böhm, Dirk Habich, Steffen Preissler...
JSAT
2010
108views more  JSAT 2010»
14 years 4 months ago
Experiment design and administration for computer clusters for SAT-solvers (EDACC)
The design of a SAT-solver or the modification of an existing one is always followed by a phase of intensive testing of the solver on a benchmark of instances. This task can be ve...
Adrian Balint, Daniel Gall, Gregor Kapler, Robert ...