549 search results - page 26 / 110 » On the Complexity of Restricted k-anonymity Problem |
PODS
2010
ACM
15 years 2 months ago
2010
ACM
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
AAAI
2008
15 years 4 days ago
2008
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
XML and semi-structured data are now de-facto standards for data exchange, and it is often the case that published or exchanged XML documents have specic restrictions on how they ...
MST
2011
14 years 4 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...