Concept

Diviser pour régner (informatique)

Publications associées (346)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Microwave Corona Breakdown Prediction in Arbitrarily-Shaped Waveguide Based Filter

Michael Mattes, Francisco Edén Sorolla Rosario

This paper describes an efficient algorithm to predict the RF gas breakdown power threshold in microwave devices with complex geometries. The two necessary calculations when investigating such a phenomenon have been performed: on the one hand, the computat ...

Institution of Engineering and Technology2010

On finding another room-partitioning of the vertices

Laura Sanità

Let T be a triangulated surface given by the list of vertex-triples of its triangles, called rooms. A room-partitioning of T is a subset R of the rooms such that each vertex of T is in exactly one room in R. We prove that if T has a room-partitioning R, th ...

2010

New Algorithms for Approximate Nash Equilibria in Bimatrix Games

We consider the problem of computing additively approximate Nash equilibria in noncooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee of 0.36392. We first provide a simpler algorithm, that achie ...

2010

Swift Algorithms for Repeated Consensus

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no timeout expires, i.e., the algorithm execution proceeds with the actual spe ...

EPFL2010

Swift Algorithms for Repeated Consensus

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2010

Optimal Linear Fusion for Distributed Detection Via Semidefinite Programming

Ali H. Sayed

Consider the problem of signal detection via multiple distributed noisy sensors. We study a linear decision fusion rule of [Z. Quan, S. Cui, and A. H. Sayed, ¿Optimal Linear Cooperation for Spectrum Sensing in Cognitive Radio Networks,¿ IEEE J. Sel. Topics ...

IEEE2010

Simultaneous Point Matching and 3D Deformable Surface Reconstruction

Pascal Fua, Appu Shaji, Aydin Varol

It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape is known. These matches can then be used to set-up a convex optimization prob ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2010

The Robot Vision Track at ImageCLEF 2010

Barbara Caputo, Marco Fornoni

This paper describes the robot vision track that has been proposed to the ImageCLEF 2010 participants. The track addressed the problem of visual place classification, with a special focus on generalization. Participants were asked to classify rooms and are ...

2010

A Weighting Scheme for Enhancing Community Detection in Networks

Martin Hasler, Alireza Khadivi

Many algorithms have recently been proposed for finding communities in networks. By definition, a community is a subset of vertices with a high number of connections among the vertices, but only few connections with other vertices. The worst drawback of mo ...

IEEE2010

Diffusion Strategies for Distributed Kalman Filtering and Smoothing

Ali H. Sayed

We study the problem of distributed Kalman filtering and smoothing, where a set of nodes is required to estimate the state of a linear dynamic system from in a collaborative manner. Our focus is on diffusion strategies, where nodes communicate with their d ...

IEEE2010