Concept

Lexique de la théorie des graphes

Publications associées (89)

Information flow decomposiiton for network coding

The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...

Institute of Electrical and Electronics Engineers2006

Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks

Jean-Pierre Hubaux, Mark Felegyhazi, Levente Buttyan

In self-organizing ad hoc networks, all the networking functions rely on the contribution of the participants. As a basic example, nodes have to forward packets for each other in order to enable multi-hop communication. In recent years, incentive mechanism ...

2006

Probabilistic Graphical Models for Human Interaction Analysis

Dong Zhang

The objective of this thesis is to develop probabilistic graphical models for analyzing human interaction in meetings based on multimodel cues. We use meeting as a study case of human interactions since research shows that high complexity information is mo ...

IDIAP2006

Probabilistic Graphical Models for Human Interaction Analysis

Dong Zhang

École Polytechnique Fédérale de Lausanne2006

Probabilistic graphical models for human interaction analysis

Dong Zhang

EPFL2006

The essence of P2P: A reference architecture for overlay networks

Karl Aberer, Manfred Hauswirth, Sarunas Girdzijauskas

The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have received specific attention from both developers and researchers. A wide varie ...

2005

The essence of P2P: A reference architecture for overlay networks

Karl Aberer, Manfred Hauswirth, Sarunas Girdzijauskas

The success of the peer-to-peer idea has created a huge diversity of approaches. A wide variety of structures and architectures have been proposed. The terminology and abstractions used, however, are quite confusing since the P2P paradigm has interested re ...

2005

New approaches for virtual private network design

Friedrich Eisenbrand

Virtual private network design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent the amount of flow that a node can send to and receive from the network. The ...

2005

Suboptimal colorings and solution of large chromatic scheduling problems

Ivo Blöchliger

Graph Coloring is a very active field of research in graph theory as well as in the domain of the design of efficient heuristics to solve problems which, due to their computational complexity, cannot be solved exactly (no guarantee that an optimal solution ...

EPFL2005

Connection Graph Stability Method for Synchronized Coupled Chaotic Systems

Martin Hasler, Igor Belykh

This paper elucidates the relation between network dynamics and graph theory. A new general method to determine global stability of total synchronization in networks with different topologies is proposed. This method combines the Lyapunov function approach ...

2004

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