192 search results - page 8 / 39 » Using SAT-Solvers to Compute Inference-Proof Database Instan... |
SRDS
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper presents an instance based approach to diagnosing failures in computing systems. Owing to the fact that a large portion of occurred failures are repeated ones, our meth...
84
Voted
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
154
click to vote
VLDB
2006
ACM
15 years 9 months ago
2006
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are li...
78
Voted
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...