Concept

Centralité

Publications associées (102)

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

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

Le management des communautés virtuelles

Olivier Glassey

In the last three decades the management of information technologies has become a major issue in most organizations. In this context, virtual communities (VC), as a means to technologically foster collective social exchanges, are often proposed as viable s ...

EPFL2005

Large scale selective event dissemination

Sidath Handurukande

Event-based systems usually denote distributed infrastructures that are used to asynchronously disseminate information among geographically distant computing units. In these systems, the information sources (a.k.a. publishers) produce events and the system ...

EPFL2005

Connectivity vs Capacity in Dense Ad Hoc Networks

Patrick Thiran, Olivier Dousse

We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuat ...

2004

Effect of composition and microstructure on the transport and piezoresistive properties of thick-film resistors

Peter Ryser, Claudio Grimaldi, Thomas Maeder, Sonia Vionnet Menot

The piezoresistive effect of thick-film resistors has found widespread application in pressure and force sensors due to their high strain-sensitivity, stability and low-cost. The main material requirements for these applications are a high piezoresistive r ...

2004

A random-resistor network model of voltage trimming

Peter Ryser, Claudio Grimaldi, Thomas Maeder

In industrial applications, the controlled adjustment (trimming) of resistive elements via the application of high voltage pulses is a promising technique, with several advantages with respect to more classical approaches such as the laser cutting method. ...

2004

Critical behaviour of the piezoresistive response in RuO2-glass composites

Peter Ryser, Claudio Grimaldi, Thomas Maeder

We re-analyse earlier measurements of resistance R and piezoresistance K in RuO2-based thick-film resistors (TFRs). The percolating nature of transport in these systems is well accounted by values of the transport exponent t larger than its universal value ...

2003

Making Consensus Practical

Rachid Guerraoui, Romain Boichat

This paper presents the abstraction of lazy consensus and argues for its use as an effective component for building distributed agreement protocols in practical asynchronous systems where processes and links can crash and recover. Lazy consensus looks like ...

2000

Accurate DC conductivity for hopping conduction within the continuous time random walk approach

William Curtin

The continuous time random walk approach for hopping conduction in disordered systems is modified to obtain accurate DC conductivity values over a wide range of hopping site densities. The modification involves eliminating a small fraction of particularly ...

2000

Computing vertex connectivity: New bounds from old techniques

Monika Henzinger

The vertex connectivity K of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known deterministic algorithm for finding the vertex connectivity and a corresponding separator. The time ...

IEEE1996