Publications related to Constraint Based Diagnosis Algorithms For Multiprocessors

Fixed Points of Generalized Approximate Message Passing with Arbitrary Matrices

The estimation of a random vector with independent components passed through a linear transform followed by a componentwise (possibly nonlinear) output map arises in a range of applications. Approximate message passing (AMP) methods, based on Gaussian appr ...

2016

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

In this paper, we design a new iterative low-complexity algorithm for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT. We suppose that N is a power of two and K = O(N^α), scales sub-linearly in N for some α ∈ (0, ...

Institute of Electrical and Electronics Engineers2015

A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

Michel Bierlaire, Tomas Robenek, Nitish Umang

In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem ...

2012

An Efficient Algorithm for Level Set Method Preserving Distance Function

Jean-Philippe Thiran, Xavier Bresson, Dominique Zosso, Virginia Estellers Casas

The level set method is a popular technique for tracking moving interfaces in several disciplines including computer vision and fluid dynamics. However, despite its high flexibility, the original level set method is limited by two important numerical issue ...

Institute of Electrical and Electronics Engineers2012

Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Boi Faltings, Immanuel Trummer

Various algorithms have been proposed for the problem of quality-driven service composition. They differ by the quality of the resulting executable processes and by their processing costs. In this paper, we study the problem of service composition from an ...

Springer-Verlag Berlin2011

Geometry-aware analysis of high-dimensional visual information sets

Effrosyni Kokiopoulou

Over the past few decades we have been experiencing a data explosion; massive amounts of data are increasingly collected and multimedia databases, such as YouTube and Flickr, are rapidly expanding. At the same time rapid technological advancements in mobil ...

EPFL2009

Segmenting memory colours

Sabine Süsstrunk, Francisco Estrada

Memory colours refer to the colour of specific image classes that have the essential attribute of being perceived in a consistent manner by human observers. In colour correction or rendering tasks, this consistency implies that they have to be faithfully r ...

2008

Constraint Solving for Software Reliability and Text Analysis

Viktor Kuncak

We will develop and implement new algorithms for constraint solving and apply them to construct two classes of tools: 1) bug finding and verification tools building on tools such as Java PathFinder and Jahob; 2) tools for deep semantic analysis of texts co ...

2008

Parametric integer programming in fixed dimension

Friedrich Eisenbrand, Gennady Shmonin

We consider the following problem: Given a rational matrix

A \in \mathbb{Q}^{m \times n}

and a rational polyhedron

Q \subseteq \mathbb{R}^{m+p}

, decide if for all vectors

b \in \mathbb{R}^m

, for which there exists an integral

z \in \mathbb{Z}^p

suc ...

2008

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Jean-Yves Le Boudec

Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing it; in most, but not all cases, they are based on the notion of bottlenecks. In spite ...

2007

Constraint Based Diagnosis Algorithms For Multiprocessors

Graph Chatbot

Chat with Graph Search

Fixed Points of Generalized Approximate Message Passing with Arbitrary Matrices

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

An Efficient Algorithm for Level Set Method Preserving Distance Function

Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Geometry-aware analysis of high-dimensional visual information sets

Segmenting memory colours

Constraint Solving for Software Reliability and Text Analysis

Parametric integer programming in fixed dimension

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Fixed Points of Generalized Approximate Message Passing with Arbitrary Matrices

Dynamically Selecting Composition Algorithms for Economical Composition as a Service

Geometry-aware analysis of high-dimensional visual information sets

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Parametric integer programming in fixed dimension

Segmenting memory colours

Constraint Solving for Software Reliability and Text Analysis

A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

An Efficient Algorithm for Level Set Method Preserving Distance Function