107 search results - page 4 / 22 » On the Optimal Selection of k in the k-Anonymity Problem |
TEC
2010
13 years 2 months ago
2010
In some expensive multiobjective optimization problems, several function evaluations can be carried out at one time. Therefore, it is very desirable to develop methods which can g...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
The problem of finding the optimal set of quantized coefficients for a frame-based encoded signal is known to be of very high complexity. This paper presents an efficient method o...
CRV
2009
IEEE
14 years 2 months ago
2009
IEEE
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
SIAMJO
2010
13 years 6 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--We investigate the relay selection problem in a network where users are able to collaborate with each other; decode and forward the messages of each other along with thei...