549 search results - page 70 / 110 » On the Complexity of Restricted k-anonymity Problem |
162
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
We consider data exchange for XML documents: given source and target schemas, a mapping between them, and a document conforming to the source schema, construct a target document a...
LPNMR
2007
Springer
15 years 4 months ago
2007
Springer
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
ESOP
2004
Springer
15 years 3 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...