Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Comparaison asymptotique

Publications associées (30)

Faster Algorithms for Integer Programs with Block Structure

Friedrich Eisenbrand, Kim-Manuel Klein, Christoph Hunkenschröder

We consider integer programming problems max {c^Tx : A x = b, l

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik2018

A design method for distributed luenberger observers

Colin Neil Jones, Francisco Fernandes Castro Rego

The paper addresses the problem of designing distributed observers for discrete linear time-invariant (LTI) systems with distributed sensor nodes subjected to bounded measurement noise. A solution is proposed in terms of a distributed LTI Luenberger observ ...

IEEE2018

Dependence properties of spatial rainfall extremes and areal reduction factors

Anthony Christopher Davison, Sebastian Engelke

Areal reduction factors (ARFs) transform an estimate of extreme rainfall at a point to an estimate of extreme rainfall over a spatial domain, and are commonly used in flood risk estimation. For applications such as the design of large infrastructure, dam s ...

2018

Increasing Availability in Distributed Storage Systems via Clustering

Michael Christoph Gastpar, Saeid Sahraei

We introduce the Fixed Cluster Repair System (FCRS) as a novel architecture for Distributed Storage Systems (DSS) that achieves a small repair bandwidth while guaranteeing a high availability. Specifically, we partition the set of servers in a DSS into s c ...

2018

Robust Bounds In Multivariate Extremes

Sebastian Engelke

Extreme value theory provides an asymptotically justified framework for estimation of exceedance probabilities in regions where few or no observations are available. For multivariate tail estimation, the strength of extremal dependence is crucial and it is ...

Institute of Mathematical Statistics2017

Gaussian versus Sparse Stochastic Processes : Construction, Regularity, Compressibility

Julien René Fageot

Although our work lies in the field of random processes, this thesis was originally motivated by signal processing applications, mainly the stochastic modeling of sparse signals. We develop a mathematical study of the innovation model, under which a signal ...

EPFL2017

Combinatorial Penalties: Which structures are preserved by convex relaxations?

Volkan Cevher, Marwa El Halabi

We consider the homogeneous and the non-homogeneous convex relaxations for combinatorial penalty functions defined on support sets. Our study identifies key differences in the tightness of the resulting relaxations through the notion of the lower combinato ...

2017

Multiple Query Optimization on the D-Wave 2X Adiabatic Quantum Computer

Christoph Koch, Immanuel Trummer

The D-Wave adiabatic quantum annealer solves hard combinatorial optimization problems leveraging quantum physics. The newest version features over 1000 qubits and was released in August 2015. We were given access to such a machine, currently hosted at NASA ...

Assoc Computing Machinery2016

Tracking residence times in hydrological systems: forward and backward formulations

Andrea Rinaldo, Paolo Benettin

In recent years, several papers contributed to the development and clarification of key theoretical issues underlying the formulation of transport by travel time distributions in catchments. Such a formulation provides a robust description of the temporal ...

Wiley-Blackwell2015

Improving Christofides' Algorithm for the s-t Path TSP

We present a deterministic (1+root 5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric metric cost on n vertices including two prespecified endpoints, the problem is to find a shortest Hamiltonian path between the t ...

Assoc Computing Machinery2015