Concept

Euclidean minimum spanning tree

Publications associées (92)

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

Fibonacci Heaps

Ali Chekir, Mohamed Slim Slama

Binomial heaps are data structures implemented as a collection of binomial trees, (A binomial tree of order K can be constructed from two trees of order (K-1)). They can implement several methods: Min, Insert, Union, ExtractMin, DecreaseKey and Delete. Fib ...

2006

Développement et étude d'une technique de microsablage à haute résolution

Anne-Gabrielle Pawlowski

We have used powder blasting as a technique to structure brittle materials like glass using an erosion resistant mask. The study of the erosion rate shows that the erosion of glass is maximum at a normal incidence of the powder beam while the erosion rate ...

EPFL2006

SUNMAP: A Tool for Automatic Topology Selection and Generation for NoCs

Giovanni De Micheli, Srinivasan Murali

Increasing communication demands of processor and memory cores in Systems on Chips (SoCs) necessitate the use of Networks on Chip (NoC) to interconnect the cores. An important phase in the design of NoCs is the mapping of cores onto the most suitable topol ...

2004

An Adaptive Algorithm for Efficient Message Diffusion in Unreliable Environments

Rodrigo Malta Schmidt, Benoît Garbinato, Fernando Pedone

In this paper, we propose a novel approach for solving the reliable broadcast problem in a probabilistic model, i.e., where links lose messages and where processes crash and recover probabilistically. Our approach consists in first defining the optimality ...

2004

Networked Slepian-Wolf: Theory and Algorithms

Martin Vetterli, Razvan Cristescu

In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generated at various sets of source nodes and have to be transmitted to some set of sink nodes ...

Springer Verlag2004

Networked Slepian-Wolf: Theory and Algorithms

Martin Vetterli, Razvan Cristescu

2004

Plate bending behavior of a pultruded GFRP bridge deck system

Thomas Keller, Martin Schollmayer

The bi-directional plate bending behavior of a pultruded GFRP bridge deck system with orthotropic material and system properties was investigated by means of two full- scale experiments and numerical modeling. Furthermore, the maximum span of the deck betw ...

2004

A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms

Felix Gaertner

Self-stabilizing systems can automatically recover from arbitrary state perturbations in finite time. They are therefore well-suited for dynamic, failure prone environments. Spanning-tree construction in distributed systems is a fundamental task which form ...

2003

Gaussian mixture models for on-line signature verification

Jonas Richiardi, Andrzej Drygajlo

This paper introduces and motivates the use of Gaussian Mixture Models (GMMs) for on-line signature verification. The individual Gaussian components are shown to represent some local, signer-dependent features that characterise spatial and temporal aspects ...

2003

Bethe approximation for self-interacting lattice trees

Paolo De Los Rios

In this paper we develop a Bethe approximation, based on the cluster variation method, which is apt to study lattice models of branched polymers. We show that the method is extremely accurate in cases where exact results are known as, for instance, in the ...

EDP Sciences2001