4908 search results - page 765 / 982 » On the Complexity of Optimal K-Anonymity |
161
click to vote
SARA
2007
Springer
16 years 21 days ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
193
click to vote
VLDB
2007
ACM
16 years 21 days ago
2007
ACM
Many enterprises nowadays use business processes, based on the BPEL standard, to achieve their goals. These are complex, often distributed, processes. Monitoring the execution of ...
173
click to vote
VLDB
2007
ACM
16 years 21 days ago
2007
ACM
The Transaction Processing Performance Council (TPC) is completing development of TPC-DS, a new generation industry standard decision support benchmark. The TPC-DS benchmark, firs...
168
click to vote
VLDB
2007
ACM
16 years 21 days ago
2007
ACM
Structured community portals extract and integrate information from raw Web pages to present a unified view of entities and relationships in the community. In this paper we argue...
176
click to vote
WABI
2007
Springer
16 years 21 days ago
2007
Springer
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...