Optimal Linear Fusion for Distributed Detection Via Semidefinite Programming
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.
This paper addresses the problem of dense disparity estimation in networks of omnidirectional cameras. We propose to map omnidirectional images on the 2-sphere, and we perform disparity estimation directly on the sphere in order to preserve the geometry of ...
In this thesis, we address different aspects of the airline scheduling problem. The main difficulty in this field lies in the combinatorial complexity of the problems. Furthermore, as airline schedules are often faced with perturbations called disruptions ...
This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an algorithm to find a polyhedral decomposition of the set of feasible parameters and to construct a piecewise affine function that ...
As an enabling functionality of overlay cognitive radio networks, spectrum sensing needs to reliably detect licensed signal in the band of interest. To achieve reliable sensing, we propose a linear fusion scheme for distributed spectrum sensing to combine ...
Meeting temperature constraints and reducing the hot-spots are critical for achieving reliable and efficient operation of complex multi-core systems. In this paper we aim at achieving an online smooth thermal control action that minimizes the performance l ...
A recent internet based survey of over 35'000 samples has shown that when different human observers are asked to assign labels to static human facial expressions, different individuals categorize differently the same image. This fact results in a lack of a ...
We propose a non-iterative solution to the PnP problem-the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences-whose computational complexity grows linearly with n. This is in contrast to state-of-the-art methods that are O( ...
Cryptography often meets the problem of distinguishing distributions. In this paper we review techniques from hypothesis testing to express the advantage of the best distinguisher limited to a given number of samples. We link it with the Chernoff informati ...
We consider the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest. We motivate and propose new versions of the diffusion LMS algorithm, including a version that outperforms previous sol ...
We exhibit explicit Lipschitz maps from R '' to R '' which have almost everywhere orthogonal gradient and are equal to zero on the boundary of a cube. We solve the problem by induction on the dimension n. (C) 2008 Elsevier Inc. All rights reserved. ...
