Concept

Problème de la clique

Publications associées (120)

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

Efficient Use of the Query Optimizer for Automated Database Design

Anastasia Ailamaki, Debabrata Dash

State-of-the-art database design tools rely on the query optimizer for comparing between physical design alternatives. Although it provides an appropriate cost model for physical design, query optimization is a computationally expensive process. The signif ...

2007

Fast Keypoint Recognition in Ten Lines of Code

Pascal Fua, Vincent Lepetit, Mustafa Özuysal

While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle perspective distortion. In this paper, we show that formulating the problem in ...

IEEE Xplore2007

Neuroevolution with Analog Genetic Encoding

Dario Floreano, Claudio Mattiussi, Peter Dürr

The evolution of artificial neural networks (ANNs) is often used to tackle difficult control problems. There are different approaches to the encoding of neural networks in artificial genomes. Analog Genetic Encoding (AGE) is a new implicit method derived f ...

2006

On the stable set polytope of claw-free graphs

Gautier Stauffer

In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been ...

EPFL2005

On the complexity of fixed parameter clique and dominating set

Friedrich Eisenbrand

We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection. © 2004 Elsevie ...

2004

Lower Bounds on Generic Broadcast Algorithms

André Schiper, Fernando Pedone

This paper establishes tight lower bounds on the time complexity of algorithms solving the generic broadcast problem. Generic broadcast assumes a symmetric, non-reflexive conflict relation on the set of messages, and requires ordered delivery only for conf ...

2004

Separable Term Structures and the Maximal Degree Problem

Damir Filipovic

This paper discusses separable term structure diffusion models in an arbitrage-free environment. Using general consistency results we exploit the interplay between the diffusion coefficients and the functions determining the forward curve. We introduce the ...

Wiley-Blackwell2002

Stochastic Bound on Delay for Guaranteed Rate Nodes

Jean-Yves Le Boudec, Milan Vojnovic

We find that the probabilistic bound on delay in the article by Goyal et al. in 1997 is incorrect. The problem originates from: 1) the difference between stationary and Palm probabilities and 2) treating the arrival counting process over some random time i ...

2002

Stochastic Bound on Delay for Guaranteed Rate Nodes

Jean-Yves Le Boudec, Milan Vojnovic

We find that the probabilistic bound on delay in [1] is incorrect. The problem originates from: (1) the difference between stationary and Palm probabilities, and (2) treating the arrival counting process over some random time intervals as if the time inter ...

2002

Video Indexing and Similarity Retrieval by Largest Common Subgraph Detection using Decision Trees

While the largest common subgraph (LCSG) between a query and a database of models can provide an elegant and intuitive measure of similarity for many applications, it is computationally expensive to compute. Recently developed algorithms for subgraph isomo ...

IDIAP2000