549 search results - page 44 / 110 » On the Complexity of Restricted k-anonymity Problem |
104
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
SE
2007
15 years 3 months ago
2007
Abstract: Software development is a complex task and therefore requires professional programming skills. Restricting the focus to a specific problem domain allows the application o...
132
click to vote
ICDT
2012
ACM
13 years 4 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
162
click to vote
LOGCOM
2010
14 years 8 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
110
click to vote
PVLDB
2010
15 years 11 days ago
2010
Virtual views are a mechanism that facilitates re-use and makes queries easier to express. However the use of iterative view definitions makes very simple query evaluation and an...