4908 search results - page 79 / 982 » On the Complexity of Optimal K-Anonymity |
154
click to vote
VLDB
1992
ACM
15 years 10 months ago
1992
ACM
In this paper, we discuss issues involving temporal data fragmentation, temporal query processing, and query optimization in multiprocessor database machines. We propose parallel ...
105
click to vote
DAGM
2003
Springer
15 years 11 months ago
2003
Springer
Optimal labeling problems are NP-hard in many practically important cases. Sufficient conditions for optimal label detection in every pixel are formulated. Knowing the values of th...
144
click to vote
AIPS
2000
15 years 7 months ago
2000
The paper takes a fresh look at algorithms for maximizing expected utility over a set of policies, that is, a set of possible ways of reacting to observations about an uncertain s...
189
click to vote
ICDE
2006
IEEE
16 years 7 days ago
2006
IEEE
We consider the problem of query optimization in distributed stream based systems where multiple continuous queries may be executing simultaneously. In such systems, distribution ...
143
click to vote
WSC
2000
15 years 7 months ago
2000
Investigation of the performance and operation of complex systems in manufacturing or other environments, analytical models of these systems become very complicated. Because of th...