Publication

On the boundedness of n-folds with κ(X) = n - 1

Publications associées (188)

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

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

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

Through thickness air permeability of prepregs during cure

Véronique Michaud, Sandra Sequeira Lopes Tavares

An experimental method based on a falling pressure measurement is proposed to evaluate the through thickness air permeability of prepregs during cure, with two set-up variants. One concerns the measurement of the inherent air permeability and the other app ...

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 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

The Coherence of Theories-Dependencies and Weights

Jingshi Li

One way to evaluate and compare rival but potentially incompatible theories that account for the same set of observations is coherence. In this paper we take the quantitative notion of theory coherence as proposed by [Kwok, et.al. 98] and broaden its found ...

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

An experimental analysis of the implicit choice set generation using the Constrained Multinomial Logit model

Michel Bierlaire, Gunnar Flötteröd, Ricardo Daniel Hurtubia González

In this paper, we compare two methods to model the formation of choice sets in the context of discrete choice models. The first method is the probabilistic approach proposed by Manski in 1977, who models the choice probability as the joint probability of s ...

2009