8780 search results - page 265 / 1756 » On the Feasibility of Consistent Computations |
192
click to vote
DIS
2004
Springer
16 years 24 days ago
2004
Springer
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In...
200
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
202
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract. Ant Colonies AC optimization take inspiration from the behavior of real ant colonies to solve optimization problems. This paper presents a parallel model for ant colonies...
168
click to vote
COMPUTING
2007
15 years 7 months ago
2007
In this paper we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such ...
186
click to vote
ICDT
2005
ACM
16 years 28 days ago
2005
ACM
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. In particular, we concentrate o...