Concept

Chaîne (théorie des graphes)

Publications associées (175)

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

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

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

EPFL2006

Reliable multi-path routing schemes for real-time streaming

Roger Hersch, Emin Gabrielyan

In off-line streaming, packet level erasure resilient forward error correction (FEC) codes rely on the unrestricted buffering time at the receiver. In real-time streaming, the extremely short playback buffering time makes FEC inefficient for protecting a s ...

IEEE Comput. Soc2006

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

Networked Slepian-Wolf: Theory, Algorithms and Scaling Laws

Martin Vetterli, Razvan Cristescu

Consider a set of correlated sources located at the nodes of a network, and a set of sinks that are the destinations for some of the sources. The minimization of cost functions which are the product of a function of the rate and a function of the path weig ...

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