4908 search results - page 192 / 982 » On the Complexity of Optimal K-Anonymity |
157
click to vote
WG
1998
Springer
15 years 10 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
157
click to vote
PLDI
1998
ACM
15 years 10 months ago
1998
ACM
Achieving good performance in bytecoded language interpreters is di cult without sacri cing both simplicity and portability. This is due to the complexity of dynamic translation (...
169
click to vote
AAAI
2008
15 years 8 months ago
2008
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
151
click to vote
AAAI
2006
15 years 8 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
214
click to vote
CAINE
2003
15 years 8 months ago
2003
Most distributed real-time embedded systems are specified combining state diagram and data flow languages. This leads to several real-time codes which together do not necessaril...