We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
Existing approaches for protecting sensitive information stored (outsourced) at external "honest-but-curious" servers are typically based on an overlying layer of encrypt...
Valentina Ciriani, Sabrina De Capitani di Vimercat...
In this work we present a method for the estimation of a rank-one pattern living in two heterogeneous spaces, when observed through a mixture in multiple observation sets. Using a ...
Ronald Phlypo, Nisrine Jrad, Bertrand Rivet, Marco...
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
Local Coordinate Coding (LCC), introduced in (Yu et al., 2009), is a high dimensional nonlinear learning method that explicitly takes advantage of the geometric structure of the d...