Publications related to Combinatory Array Logic with Sums

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.

Stable Fractional Matchings

Aris Filos Ratsikas

We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings c ...

ASSOC COMPUTING MACHINERY2019

String Matching: Communication, Circuits, and Learning

Mika Tapani Göös

String matching is the problem of deciding whether a given n-bit string contains a given k-bit pattern. We study the complexity of this problem in three settings. - Communication complexity. For small k, we provide near-optimal upper and lower bounds on th ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2019

Extreme Image Completion

Sabine Süsstrunk, Radhakrishna Achanta, Nikolaos Arvanitopoulos Darginis

It is challenging to complete an image whose 99 percent pixels are randomly missing. We present a solution to this extreme image completion problem. As opposed to existing techniques, our solution has a computational complexity that is linear in the number ...

Ieee2017

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

We propose to approximate two-stage distributionally robust programs with binary recourse decisions by their associated K-adaptability problems, which pre-select K candidate second-stage policies here-and-now and implement the best of these policies once t ...

Elsevier Science Bv2016

A Comment on “Computational Complexity of Stochastic Programming Problems”

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

Although stochastic programming problems were always believed to be computationally challenging, this perception has only recently received a theoretical justification by the seminal work of Dyer and Stougie (Mathematical Programming A, 106(3):423–432, 200 ...

Springer Heidelberg2016

Phase Transitions in Group Testing

Volkan Cevher, Jonathan Mark Scarlett

The group testing problem consists of determining a sparse subset of a set of items that are ``defective'' based on a set of possibly noisy tests, and arises in areas such as medical testing, fault detection, communication protocols, pattern matching, and ...

2016

K-Adaptability in Two-Stage Robust Binary Programming

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

Over the last two decades, robust optimization has emerged as a computationally attractive approach to formulate and solve single-stage decision problems affected by uncertainty. More recently, robust optimization has been successfully applied to multi-sta ...

Informs2015

Marriage stability, taxation and aggregate labor supply in the U.S. vs. Europe

Serhiy Stepanchuk

Americans work more than Europeans. Using micro-data from the United States and 17 European countries, we document that women are typically the largest contributors to the cross-country differences in work hours. We also show that there is a negative relat ...

Elsevier Science Bv2015

Combinatory Array Logic with Sums

Graph Chatbot

Chat with Graph Search

Stable Fractional Matchings

String Matching: Communication, Circuits, and Learning

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

The complexity of error metrics

Extreme Image Completion

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

A Comment on “Computational Complexity of Stochastic Programming Problems”

Phase Transitions in Group Testing

K-Adaptability in Two-Stage Robust Binary Programming

Marriage stability, taxation and aggregate labor supply in the U.S. vs. Europe

A Comment on “Computational Complexity of Stochastic Programming Problems”

String Matching: Communication, Circuits, and Learning

Stable Fractional Matchings

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

The complexity of error metrics

Extreme Image Completion

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Phase Transitions in Group Testing

Marriage stability, taxation and aggregate labor supply in the U.S. vs. Europe

K-Adaptability in Two-Stage Robust Binary Programming