Publication

Orthogeodesic Point-Set Embedding of Trees

Related publications (96)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Delineating Trees in Noisy 2D Images and 3D Image Stacks

Pascal Fua, François Fleuret, Engin Türetken, Germán González Serrano

We present a novel approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, our method builds a set of candidate trees over many different subsets of point ...

2010

Propagation of geotags based on object duplicate detection

Touradj Ebrahimi, Jong Seok Lee, Lutz Goldmann, Ivan Ivanov, Péter Vajda

In this paper, we consider the use of object duplicate detection for the propagation of geotags from a small set of images with location names (IPTC) to a large set of non-tagged images. The motivation behind this idea is that images of individual location ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2010

Generalizing State Machine Replication

Rachid Guerraoui

We show that, with k-set consensus, any number of processes can emulate k state machines of which at least one progresses. This generalizes the celebrated universality of consensus which enables to build a state machine that always progresses. Besides some ...

2010

Alumni Profiles

Former PhD students, post-docs and junior researchers of the Section de chimie et biochimie now holding positions at different universities and private companies remember the time they spent in Geneva and give an account of how this has set off and influen ...

2009

A Topological Treatment of Early-Deciding Set-Agreement

Rachid Guerraoui, Bastian Pochon

The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus ...

2009

Structural identification to improve bridge management

Ian Smith, James-Alexandre Goulet

This paper presents results from static loads tests performed on the new Langensand Bridge built in Switzerland. A systematic study of over 1000 models subjected to three load cases identifies a set of 11 candidate models through static measurements. Predi ...

International Association for Bridge and Structural Engineering2009

A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows

Matteo Salani

The Vehicle Routing Problem with Soft Time Windows consists in computing a minimum cost set of routes for a fleet of vehicles of limited capacity that must visit a given set of customers with known demand, with the additional feature that each customer exp ...

2009

Network coding for undirected information exchange

Christina Fragouli, Suhas Diggavi

We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achie ...

2009

A property of Bp(G). Applications to convolution operators

Antoine Derighetti

A new property of B-p(G), permits to obtain an approximation theorem for p-convolution operators and a non-commutative version of the Lohoues monomorphism theorem concerning the norm closure of the set of all p-convolution operators with compact support. ( ...

2009

On the weakest failure detector ever

Rachid Guerraoui

Many problems in distributed computing are impossible to solve when no information about process failures is available. It is common to ask what information about failures is necessary and sufficient to circumvent some specific impossibility, e. g., consen ...

Springer Verlag2009