Concept

Sommet (théorie des graphes)

Publications associées (183)

Graphical Comparison of Image Analysis and Laser Diffraction Particle, Size Analysis Data Obtained From the Measurements of Nonspherical Particle Systems

The purpose of this paper is to describe results from the use of a set of Excel macros written to facilitate the comparison of image analysis (IA) and laser diffraction (LD) particle size analysis (psa) data. Measurements were made on particle systems of d ...

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

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

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

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

The evolution of network topology by selective removal

Marcel Salathé

The topology of large social, technical and biological networks such as the World Wide Web or protein interaction networks has caught considerable attention in the past few years (reviewed in Newman 2003), and analysis of the structure of such networks rev ...

2005

Polar cographs

Dominique de Werra, Tinaz Ekim

Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s,k)-polar if there exists a partition A,B of its vertex set such that A induces a complete s-partite graph ...

2005

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