1464 search results - page 109 / 293 » On optimal anonymization for l -diversity |
149
click to vote
SAC
1996
ACM
15 years 10 months ago
1996
ACM
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
166
click to vote
ICS
1993
Tsinghua U.
15 years 10 months ago
1993
Tsinghua U.
This paper examines the effectiveness of decoupling as an optimization technique for high-performance computer architectures. Decoupled access execute architectures are described,...
178
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
203
click to vote
NIPS
2003
15 years 7 months ago
2003
We describe a nonparametric Bayesian approach to generalizing from few labeled examples, guided by a larger set of unlabeled objects and the assumption of a latent tree-structure ...
127
click to vote
JSS
2008
15 years 6 months ago
2008
This paper explores how process pipeline scheduling may become a viable strategy for executing workflows. It first details a workflow optimization and execution algorithm that redu...