Concept

Dépassement d'entier

Publications associées (32)

Detecting and Tracking Cells using Network Flow Programming

Pascal Fua, Engin Türetken, Xinchao Wang, Carlos Joaquin Becker

We propose a novel approach to automatically detecting and tracking cell populations in time-lapse images. Unlike earlier ones that rely on linking a predetermined and potentially under-complete set of detections, we generate an overcomplete set of competi ...

2015

Design of a diversion structure for the management of residual risks using physical model tests

Giovanni De Cesare, Raphaël Sprenger, Antoine Magnollay

As revitalization and protection against floods are essential in our time, the town of Delémont in Switzerland has set up a major project named “Delémont Marée Basse”. Part of the project, the residual risk plans to be managed by a lateral overflow bypassi ...

CRC Press/Balkema2014

Tracking Interacting Objects Optimally Using Integer Programming

Pascal Fua, François Fleuret, Engin Türetken, Xinchao Wang

In this paper, we show that tracking different kinds of interacting objects can be formulated as a network-flow Mixed Integer Program. This is made possible by tracking all objects simultaneously and expressing the fact that one object can appear or disapp ...

Springer Int Publishing Ag2014

Simultaneous Segmentation and Anatomical Labeling of the Cerebral Vasculature

Pascal Fua, Engin Türetken, David Robben

We present a novel algorithm for the simultaneous segmentation and anatomical labeling of the cerebral vasculature. The method first constructs an over-complete graph capturing the vasculature. It then selects and labels the subset of edges that most likel ...

2014

Nonbinary Associative Memory With Exponential Pattern Retrieval Capacity and Iterative Learning

Mohammad Amin Shokrollahi, Krishna Kumar, Amir Hesam Salavati

We consider the problem of neural association for a network of nonbinary neurons. Here, the task is to first memorize a set of patterns using a network of neurons whose states assume values from a finite number of integer levels. Later, the same network sh ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Reconstructing Loopy Curvilinear Structures Using Integer Programming

Pascal Fua, Engin Türetken, Fethallah Benmansour

We propose a novel approach to automated delineation of linear structures that form complex and potentially loopy networks. This is in contrast to earlier approaches that usually assume a tree topology for the networks. At the heart of our method is an Int ...

Ieee2013

On The Convergence Of The Affine Hull Of The Chvatal-Gomory Closures

Yuri Faenza, Marco Di Summa

Given an integral polyhedron P subset of R-n and a rational polyhedron Q subset of R-n containing the same integer points as P, we investigate how many iterations of the Chvatal-Gomory closure operator have to be performed on Q to obtain a polyhedron conta ...

Siam Publications2013

Testing additive integrality gaps

Friedrich Eisenbrand, Gennady Shmonin

We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed as a generalization of the integer rounding property, which can be tested in ...

Springer Berlin Heidelberg2013

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Rüdiger Urbanke, Seyed Hamed Hassani

Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the performance to ...

Ieee2012

Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization

Rüdiger Urbanke, Seyed Hamed Hassani

2012

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