Abstract. In this paper, we propose a novel preference-constrained approach to k-anonymisation. In contrast to the existing works on kanonymisation which attempt to satisfy a minim...
—In this paper, we consider the problem of routing and wavelength assignment (RWA) in all-optical networks, where signals propagate in the optical domain (with no electrical rege...
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...