Publications related to Segmenting memory colours

Results on Sparse Integer Programming and Geometric Independent Sets

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n.Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed p ...

EPFL2023

Efficient Preparation of Cyclic Quantum States

Giovanni De Micheli, Fereshte Mozafari Ghoraba

Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...

IEEE2022

Approximate CVPp in time 2(0.802n)

Friedrich Eisenbrand, Moritz Andreas Venzin

We show that a constant factor approximation of the shortest and closest lattice vector problem in any l(p)-norm can be computed in time 2((0.802 + epsilon)n). This matches the currently fastest constant factor approximation algorithm for the shortest vect ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

Two-step phase shifting interferometry based on orientation selective monogenic filtering

Pramod Rastogi, Rishikesh Dilip Kulkarni

We propose a phase step estimation algorithm in a two-step phase shifting interferometry setup based on orientation selective adaptive monogenic filtering (AMF). Initially, the AMF algorithm is used for the fringe pattern normalization. A minor modificatio ...

2019

When Stuck, Flip a Coin

Slobodan Mitrovic

Many modern services need to routinely perform tasks on a large scale. This prompts us to consider the following question: How can we design efficient algorithms for large-scale computation? In this thesis, we focus on devising a general strategy to addr ...

EPFL2018

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Volkan Cevher, Ilija Bogunovic, Slobodan Mitrovic, Ashkan Norouzi Fard, Jakub Tarnawski

We study the classical problem of maximizing a monotone submodular function subject to a cardinality constraint k, with two additional twists: (i) elements arrive in a streaming fashion and (ii) m items from the algorithm’s memory might be removed after th ...

2017

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

A Distributed Algorithm for Partitioned Robust Submodular Maximization

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

Abstract—In this paper, we consider the problem of maximizing a monotone submodular function subject to a cardinality constraint, with two added twists: The computation is distributed across a number of machines, and we require the solution to be robust ag ...

2017

Single Image Reflection Suppression

Sabine Süsstrunk, Radhakrishna Achanta, Nikolaos Arvanitopoulos Darginis

Reflections are a common artifact in images taken through glass windows. Automatically removing the reflection artifacts after the picture is taken is an ill-posed problem. Attempts to solve this problem using optimization schemes therefore rely on various ...

Ieee2017

Decentralized consensus optimization with asynchrony and delays

Ali H. Sayed, Kun Yuan, Tianyu Wu

We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network of agents, where the agents perform local computation and communicate with neighbors. We design the algorithm so that the agents can compute a ...

IEEE2016

Segmenting memory colours

Graph Chatbot

Chat with Graph Search

Results on Sparse Integer Programming and Geometric Independent Sets

Efficient Preparation of Cyclic Quantum States

Approximate CVPp in time 2(0.802n)

Two-step phase shifting interferometry based on orientation selective monogenic filtering

When Stuck, Flip a Coin

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

A Distributed Algorithm for Partitioned Robust Submodular Maximization

Single Image Reflection Suppression

Decentralized consensus optimization with asynchrony and delays

Approximate CVPp in time 2(0.802n)

When Stuck, Flip a Coin

Results on Sparse Integer Programming and Geometric Independent Sets

Single Image Reflection Suppression

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Two-step phase shifting interferometry based on orientation selective monogenic filtering

Decentralized consensus optimization with asynchrony and delays

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Efficient Preparation of Cyclic Quantum States

A Distributed Algorithm for Partitioned Robust Submodular Maximization