Publications related to Quantum complexity theory

A Polynomial Regularity Lemma For Semialgebraic Hypergraphs And Its Applications In Geometry And Property Testing

In this paper, we prove several extremal results for geometrically defined hypergraphs. In particular, we establish an improved lower bound, single exponentially decreasing in k, on the best constant delta > 0 such that the vertex classes P-1,...,P-k of ev ...

Society for Industrial and Applied Mathematics2016

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

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

MATHICSE Technical Report : Fast computation of the matrix exponential for a Toeplitz matrix

Daniel Kressner, Robert Gerhard Jérôme Luce

The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured n×n matrix it can be computed in O(n3) operations. An interesting problem arises if the input matrix is a Toeplitz matrix, for exa ...

MATHICSE2016

Multi-index Monte Carlo: when sparsity meets sampling

Fabio Nobile

We propose and analyze a novel Multi Index Monte Carlo (MIMC) method for weak approximation of stochastic models that are described in terms of differential equations either driven by random measures or with random coefficients. The MIMC method is both a s ...

2016

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

FaCSI: A block parallel preconditioner for fluid-structure interaction in hemodynamics

Alfio Quarteroni, Simone Deparis, Davide Forti, Gwenol Grandperrin

Modeling Fluid-Structure Interaction (FSI) in the vascular system is mandatory to reliably compute mechanical indicators in vessels undergoing large deformations. In order to cope with the computational complexity of the coupled 3D FSI problem after discre ...

Academic Press Inc Elsevier Science2016

Fast Robust PCA on Graphs

Pierre Vandergheynst, Gilles Puy, Nathanaël Perraudin, Nauman Shahid, Vasilis Kalofolias

Mining useful clusters from high dimensional data has received significant attention of the computer vision and pattern recognition community in the recent years. Linear and non-linear dimensionality reduction has played an important role to overcome the c ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Essays on Capital Calculation in Insurance

Mathieu Jacques David Cambou

In order to be able to bear the risk they are taking, insurance companies have to set aside a certain amount of cushion that can guarantee the payment of liabilities, up to a dened probability, and thus to remain solvent in case of bad events. This amount ...

EPFL2016

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering

Pierre Vandergheynst, Xavier Bresson, Michaël Defferrard

In this work, we are interested in generalizing convolutional neural networks (CNNs) from low-dimensional regular grids, where image, video and speech are represented, to high-dimensional irregular domains, such as social networks, brain connectomes or wor ...

2016

Quantum complexity theory

Graph Chatbot

Chat with Graph Search

A Polynomial Regularity Lemma For Semialgebraic Hypergraphs And Its Applications In Geometry And Property Testing

A Comment on “Computational Complexity of Stochastic Programming Problems”

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

MATHICSE Technical Report : Fast computation of the matrix exponential for a Toeplitz matrix

Multi-index Monte Carlo: when sparsity meets sampling

Phase Transitions in Group Testing

FaCSI: A block parallel preconditioner for fluid-structure interaction in hemodynamics

Fast Robust PCA on Graphs

Essays on Capital Calculation in Insurance

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering

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

A Polynomial Regularity Lemma For Semialgebraic Hypergraphs And Its Applications In Geometry And Property Testing

Essays on Capital Calculation in Insurance

Multi-index Monte Carlo: when sparsity meets sampling

MATHICSE Technical Report : Fast computation of the matrix exponential for a Toeplitz matrix

Phase Transitions in Group Testing

FaCSI: A block parallel preconditioner for fluid-structure interaction in hemodynamics

Fast Robust PCA on Graphs

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering

A Comment on “Computational Complexity of Stochastic Programming Problems”