Publications related to Global mixed-integer dynamic optimization

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

We present an iterative retrieval algorithm based on data constraint for ultrashort pulse characterization using dispersion scan (d-scan). The proposed algorithm is much faster and leads to a drastic reduction of retrieval times, but, compared to the stand ...

Optical Society of America2017

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

An Efficient Streaming Algorithm for the Submodular Cover Problem

Volkan Cevher, Ilija Bogunovic, Ya-Ping Hsieh, Ashkan Norouzi Fard, Abbas Bazzi, Marwa El Halabi

We initiate the study of the classical Submodular Cover (SC) problem in the data streaming model which we refer to as the Streaming Submodular Cover (SSC). We show that any single pass streaming algorithm using sublinear memory in the size of the stream wi ...

2016

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

Synthesizing efficient systems in probabilistic environments

Barbara Jobstmann, David Parker

We present a formalism, algorithms and tools to synthesise reactive systems that behave efficiently, i.e., which achieve an optimal trade-off between a given cost and reward model. Synthesis aims to automatically generate a program from a specification. Mo ...

Springer2016

Observations on the LPN Solving Algorithm from Eurocrypt'16

Serge Vaudenay, Sonia Mihaela Bogos

In this note we re-evaluate the Eurocrypt’16 paper by Zhang et al. [9] in the area of LPN solving algorithms. We present the history of LPN solving algorithms and give the general description of the algorithm from [9]. While this new algorithm claims to im ...

2016

Parsing human skeletons in an operating room

Pascal Fua, Slobodan Ilic, Xinchao Wang, Horesh Beny Ben Shitrit, Vasileios Belagiannis

Multiple human pose estimation is an important yet challenging problem. In an Operating Room (OR) environment, the 3D body poses of surgeons and medical staff can provide important clues for surgical workflow analysis. For that purpose, we propose an algor ...

Springer Verlag2016

Target-based fiber assignment for large survey spectrographs

Jean-Paul Richard Kneib, Laleh Makarem

Next generation massive spectroscopic survey projects have to process a massive amount of targets. The preparation of subsequent observations should be feasible in a reasonable amount of time. We present a fast algorithm for target assignment that scales a ...

Spie-Int Soc Optical Engineering2016

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

Francesco Mondada, Michael Bonani

This chapter presents a disaster recovery scenario that has been used throughout the ASCENS project as a reference to coordinate the study of distributed algorithms for robot ensembles. We first introduce the main traits and open problems in the design of ...

Springer2015

Global mixed-integer dynamic optimization

Graph Chatbot

Chat with Graph Search

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

An Efficient Streaming Algorithm for the Submodular Cover Problem

Decentralized consensus optimization with asynchrony and delays

Synthesizing efficient systems in probabilistic environments

Observations on the LPN Solving Algorithm from Eurocrypt'16

Parsing human skeletons in an operating room

Target-based fiber assignment for large survey spectrographs

Centrality of trees for capacitated -center

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

Fast iterative retrieval algorithm for ultrashort pulse characterization using dispersion scans

An Efficient Streaming Algorithm for the Submodular Cover Problem

Observations on the LPN Solving Algorithm from Eurocrypt'16

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Target-based fiber assignment for large survey spectrographs

Centrality of trees for capacitated -center

Synthesizing efficient systems in probabilistic environments

Decentralized consensus optimization with asynchrony and delays

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

Parsing human skeletons in an operating room