4908 search results - page 730 / 982 » On the Complexity of Optimal K-Anonymity |
170
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
176
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
166
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
323
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
259
click to vote
VLDB
2006
ACM
16 years 6 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...