Utility/privacy trade-off as regularized optimal transport
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We present a method that exploits an information theoretic framework to extract optimized audio features using the video information. A simple measure of mutual information (MI) between the resulting audio features and the video ones allows to detect the a ...
We present in this paper a new complete method for distributed constraint optimization. This is a utility-propagation method, inspired by the sum-product algorithm. The original algorithm requires fixed message sizes, linear memory, and is time-linear in t ...
Universal Multimedia Access (UMA) refers to the ability to access by any user to the desired multimedia content(s) over any type of network with any device from anywhere and anytime. UMA is a key framework for multimedia content delivery service using meta ...
In solving a robust version of regularized least squares with weighting, a certain scalar-valued optimization problem is required in order to determine the regularized robust solution and the corresponding robustified weighting parameters. This letter esta ...
Interplay between Identification and Optimization in Run-to-run Schemes B. Srinivasan, D. Bonvin ´ Institut d’Automatique, Ecole Polytechnique F´d´rale de Lausanne, ee CH-1015 Lausanne, Switzerland. Optimization of batch processes has received increasing at ...
Some misbehavior detection and reputation systems in mobile ad-hoc networks rely on the dissemination of information of observed behavior, which makes them vulnerable to false accusations. This vulnerability could be removed by forbidding the dissemination ...
We consider the problem of compressing a Gaussian source for two decoders, one of which has access to side-information. Kaspi has solved this problem for discrete memoryless sources for the two cases with and without encoder side-information. We focus on t ...
Growth temperatures between 450 and 520 degrees C and V/III ratios of 2-8 were explored to optimize the crystalline quality and the transport properties of compressively strained InxGa1-xAs/InP heterostructures (0.53 < x < 1). 77 K Hall mobilities as high ...
Metalation/trapping sequences applied to relatively inert, tert-alkyl substituted arenes tend to give poor yields unless the reagent is used in high concns. Under optimized conditions, even 1,4-bis(tert-butyl)benzene, 1,1,3,3-tetramethylindane and 1,1,2,2, ...
We present in this paper a new complete method for distributed constraint optimization. This is a utility-propagation method, inspired by the sum-product algorithm (Kschischang et al 2001). The original algorithm requires fixed message sizes, linear memory ...
