Publications related to Video Indexing and Similarity Retrieval by Largest Common Subgraph Detection using Decision Trees

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

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

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

Matrix Recipes for Hard Thresholding Methods

Volkan Cevher, Anastasios Kyrillidis

In this paper, we present and analyze a new set of low-rank recovery algorithms for linear inverse problems within the class of hard thresholding methods. We provide strategies on how to set up these algorithms via basic ingredients for different configura ...

Springer Verlag2014

A reduced computational and geometrical framework for inverse problems in haemodynamics

Alfio Quarteroni, Gianluigi Rozza, Andrea Manzoni, Toni Mikael Lassila

The solution of inverse problems in cardiovascular mathematics is computationally expensive. In this paper we apply a domain parametrization technique to reduce both the geometrical and computational complexity of the forward problem, and replace the finit ...

Wiley-Blackwell2013

Strongly feasible stochastic model predictive control

Milan Korda

In this article we develop a systematic approach to enforce strong feasibility of probabilistically constrained stochastic model predictive control problems for linear discrete-time systems under affine disturbance feedback policies. Two approaches are pre ...

2011

Recipes on Hard Thresholding Methods

Volkan Cevher, Anastasios Kyrillidis

Compressive sensing (CS) is a data acquisition and recovery technique for finding sparse solutions to linear inverse problems from sub-Nyquist measurements. CS features a wide range of computationally efficient and robust signal recovery methods, based on ...

2011

A Weighting Scheme for Enhancing Community Detection in Networks

Martin Hasler, Alireza Khadivi

Many algorithms have recently been proposed for finding communities in networks. By definition, a community is a subset of vertices with a high number of connections among the vertices, but only few connections with other vertices. The worst drawback of mo ...

IEEE2010

Recursive column generation for the Tactical Berth Allocation Problem

Michel Bierlaire, Matteo Salani, Ilaria Vacca

Seaport container terminals are source of many interesting large-scale optimization problems, that arise in the management of operations at several decision levels. In this work we study exact methods to solve the Tactical Berth Allocation Problem with Qua ...

2010

FASTER CADZOW DENOISING BASED ON PARTIAL EIGENVALUE DECOMPOSITION

Yann Barbotin

Certain aspects of the present disclosure relate to a method for speeding up the Cadzow iterative denoising algorithm as a part of the Finite Rate of Innovation (FRI) processing and for decreasing its computational complexity. ...

USPTO2010

Video Indexing and Similarity Retrieval by Largest Common Subgraph Detection using Decision Trees

Graph Chatbot

Chat with Graph Search

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

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

A Comment on “Computational Complexity of Stochastic Programming Problems”

Matrix Recipes for Hard Thresholding Methods

A reduced computational and geometrical framework for inverse problems in haemodynamics

Strongly feasible stochastic model predictive control

Recipes on Hard Thresholding Methods

A Weighting Scheme for Enhancing Community Detection in Networks

Recursive column generation for the Tactical Berth Allocation Problem

FASTER CADZOW DENOISING BASED ON PARTIAL EIGENVALUE DECOMPOSITION

A Comment on “Computational Complexity of Stochastic Programming Problems”

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

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

A reduced computational and geometrical framework for inverse problems in haemodynamics

Matrix Recipes for Hard Thresholding Methods

FASTER CADZOW DENOISING BASED ON PARTIAL EIGENVALUE DECOMPOSITION

A Weighting Scheme for Enhancing Community Detection in Networks

Strongly feasible stochastic model predictive control

Recursive column generation for the Tactical Berth Allocation Problem

Recipes on Hard Thresholding Methods