Concept

Subset

Related publications (49)

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

Network Formulations of Mixed-Integer Programs

Friedrich Eisenbrand, Marco Di Summa

We consider mixed-integer sets described by system of linear inequalities in which the constraint matrix A is totally unimodular; the right-hand side is arbitrary vector; and a subset of the variables is required to be integer. We show that the problem of ...

INFORMS2009

On Degraded Two Message Set Broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message

W_1

to an arbitrary set of receivers

\mathcal{U}

and a private message

W_2

to a subset of the receivers

\mathcal{P}\subseteq \mathcal{U}

. Transmissions occur over l ...

EPFL Technical Report2009

Convexly independent subsets of the Minkowski sum of planar point sets

János Pach, Friedrich Eisenbrand, Thomas Rothvoss

Let P and Q be finite sets of points in the plane. In this note we consider the largest cardinality of a subset of the Minkowski sum S ⊆ P⊕Q which consist of convex independent points. We show that, if P and Q contain at most n points, then |S| = O(n^(4/3) ...

American Mathematical Society2008

Sharing is Harder than Agreeing

Rachid Guerraoui

One of the most celebrated results of the theory of distributed computing is the impossibility, in an asynchronous system of

n

processes that communicate through shared memory registers, to solve the set agreement problem where the processes need to deci ...

2008

Consensus and collision detectors in radio networks

Seth Gilbert

We consider the fault-tolerant consensus problem in radio networks with crash-prone nodes. Specifically, we develop lower bounds and matching upper bounds for this problem in single-hop radios networks, where all nodes are located within broadcast range of ...

2008

Hitting time of large subsets of the hypercube

Jiri Cerny, Véronique Gayrard

We study the simple random walk on the n-dimensional hypercube, in particular its hitting times of large (possibly random) sets. We give simple conditions on these sets ensuring that the properly rescaled hitting time is asymptotically exponentially distri ...

2008

Weak metrics on Euclidean domains

Marc Troyanov

A weak metric on a set is a function that satisfies the axioms of a metric except the symmetry and the separation axioms. The aim of this paper is to present some interesting weak metrics and to study some of their properties. In particular, we introduce a ...

2007

Sampling of alternatives using multidimensional analysis

Michel Bierlaire

Discrete choice models in general and random utility models in particular may be intractable when the number of alternatives is large. In the transportation context, it typically happens for route choice and destination choice models. In the specific case ...

2007

The KeY Tool

KeY is a tool that provides facilities for formal specification and verification of programs within a commercial platform for UML based software development. Using the KeY tool, formal methods and object-oriented development techniques are applied in an in ...

Springer2005