Concept

Arbre binaire

Publications associées (151)

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

Reconstructing Geometrically Consistent Tree Structures from Noisy Images

Pascal Fua, Engin Türetken, Germán González Serrano

We present a novel approach to fully automated reconstruction of tree structures in noisy 2D images. Unlike in earlier approaches, we explicitly handle crossovers and bifurcation points, and impose geometric constraints while optimizing a global cost funct ...

2010

Optimal decision trees for point location in polytopic data sets - application to explicit MPC

Colin Neil Jones

Explicit Model Predictive Control (EMPC) produces control laws defined over a set of polytopic regions in the state space. In this paper we present a method to create a binary search tree for point location in such polytopic sets, in order to provide a fas ...

2010

Stable routing under the Spanning Tree Protocol

Laura Sanità

The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we design efficient algorithms to compute polynomial-size integer weights so as t ...

Elsevier2010

NC Node Selection Game in Collaborative Streaming Systems

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distributed streaming systems. It permits to take advantage of the path and node diversi ...

2010

COMBINE: An Improved Directory-Based Consistency Protocol

Vincent Gramoli, Hagit Albo Attiya

This paper presents COMBINE, a directory-based consistency protocol for shared objects, designed for large-scale distributed systems with unreliable links. Directory-based consistency protocols support move requests, allowing to write the object locally, a ...

2010

Variance stabilizing transformations for meta-analysis of binary data

Philippe Vuistiner

The binary data are often used in the medical field or in social sciences to study an effect between two groups. It can be for example the effect of a treatment between a treated and a control group. The outcome will be the number of successes and the tota ...

2010

BRIEF: Binary Robust Independent Elementary Features

Pascal Fua, Vincent Lepetit, Christoph Strecha, Michael Calonder

We propose to use binary strings as an efficient feature point descriptor, which we call BRIEF. We show that it is highly discriminative even when using relatively few bits and can be computed using simple intensity difference tests. Furthermore, the descr ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

The VPN problem with concave costs

Laura Sanità

Only recently Goyal, Olver and Shepherd (Proc. STOC, 2008) proved that the symmetric Virtual Private Network Design (sVPN) problem has the tree routing property, namely, that there always exists an optimal solution to the problem whose support is a tree. C ...

2010

Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

This article concerns the following question arising in computational evolutionary biology. For a given subclass of phylogenetic networks, what is the maximum value of 0

2010

A separator theorem for string graphs and its applications

János Pach

A string graph is the intersection graph of a collection of continuous arcs in the plane. We show that any string graph with in edges can be separated into two parts of roughly equal size by the removal of O(m(3/4)root log m) vertices. This result is then ...

Cambridge University Press2010