Publication

On the Structure of Cortical Microcircuits Inferred from Small Sample Sizes

Publications associées (108)

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

On the Performance of Clustered Energy-Aware Wireless Networks

Ali H. Sayed

We propose a robust energy-aware clustering architecture for large-scale wireless sensor networks and analyze its performance in terms of throughput capacity and power consumption. The results show that clustered networks can achieve performance improvemen ...

IEEE2006

A statistical physics perspective of complex networks

Thomas Petermann

A statistical physics perspective of complex networks: from the architecture of the Internet and the brain to the spreading of an epidemic Statistical physics has revealed itself as the ideal framework to describe large networks appearing in a variety of d ...

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

Synchronization in complex networks with blinking interactions

Martin Hasler, Igor Belykh

We propose a new model of small-world networks of cells with a time-varying coupling and study its synchronization properties. In each time interval of length /spl tau/ such a coupling is switched on with probability p and the corresponding switching rando ...

2005

Media Aware Routing in Large Scale Networks with Overlay

Pascal Frossard, Dan Jurca, Sofija Petrovic

This paper presents a new routing strategy, that selects the best network paths in an overlay network, in order to minimize the distortion perceived by the end user. We first propose a model that reports the video distortion as a function of the encoding r ...

2005

Synchronization and Graph Topology

Martin Hasler, Igor Belykh

This paper clarifies the relation between synchronization and graph topology. Applying the Connection Graph Stability method developed by Belykh et al. [2004a] to the study of synchronization in networks of coupled oscillators, we show which graph properti ...

2005

Analyzing Semantic Interoperability in Bioinformatic Database Networks

Karl Aberer, Philippe Cudré-Mauroux, Adriana Budura, Julien Gaugaz

We consider the problem of analytically evaluating semantic interoperability in large-scale networks of schemas interconnected through pairwise schema mappings. Our heuristics are based on a graph-theoretic framework capturing important statistical propert ...

2005

Signal buffering in random networks of spiking neurons: microscopic vs. macroscopic phenomena

Wulfram Gerstner, Julien Mayor

In randomly connected networks of pulse-coupled elements a time-dependent input signal can be buffered over a short time. We studied the signal buffering properties in simulated networks as a function of the networks' state, characterized by both the Lyapu ...

2005

Analysis of a Synonymy Network

Paolo De Los Rios, Jean-Cédric Chappelier, David Gfeller

The purpose of this report is to present the study of a linguistic network based on the relation of synonymy. The network has been extracted from a dictionary of synonyms in French. Due to errors and ambiguities in the data, the synonyms are not always gro ...

2004

Protocol overheads in networks

Prasenjit Dey

To increase network capacity, it may not be sufficient to just increase the capacity of the networks. It may be necessary to reduce the network overhead bits, to leave more room for the data bits, to increase the network capacity. As network functions beco ...

EPFL2004