Publications related to Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

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

Efficient Algorithms for the Data Exchange Problem

Michael Christoph Gastpar, Sameer Pawar

In this paper, we study the data exchange problem, where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-information. Assuming that the file is broken into packets, the side-inform ...

Institute of Electrical and Electronics Engineers2016

Parallelizing Query Optimization on Shared-Nothing Architectures

Christoph Koch, Immanuel Trummer

Data processing systems offer an ever increasing degree of parallelism on the levels of cores, CPUs, and processing nodes. Query optimization must exploit high degrees of parallelism in order not to gradually become the bottleneck of query evaluation. We s ...

Assoc Computing Machinery2016

From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization

Immanuel Trummer

The goal of query optimization is to map a declarative query (describing data to generate) to a query plan (describing how to generate the data) with optimal execution cost. Query optimization is required to support declarative query interfaces. It is a co ...

EPFL2016

Memetic Viability Evolution for Constrained Optimization

Dario Floreano, Andrea Maesani, Giovanni Iacca

The performance of evolutionary algorithms can be heavily undermined when constraints limit the feasible areas of the search space. For instance, while Covariance Matrix Adapta- tion Evolution Strategy is one of the most efficient algorithms for unconstrai ...

Institute of Electrical and Electronics Engineers2016

Reliable and Real-Time Distributed Abstractions

David Kozhaya

The celebrated distributed computing approach for building systems and services using multiple machines continues to expand to new domains. Computation devices nowadays have additional sensing and communication capabilities, while becoming, at the same tim ...

EPFL2016

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Complexity Constrained Representation Selection for Dynamic Adaptive Streaming

Pascal Frossard, Laura Toni, Chenglin Li

In this paper, we propose a representation selection optimization problem for complexity constrained adaptive video streaming that properly takes into account the different complexity-rate-distortion (C-R-D) characteristics of the videos when implementing ...

Ieee2016

Riemannian Optimization for Solving High-Dimensional Problems with Low-Rank Tensor Structure

Michael Maximilian Steinlechner

In this thesis, we present a Riemannian framework for the solution of high-dimensional optimization problems with an underlying low-rank tensor structure. Here, the high-dimensionality refers to the size of the search space, while the cost function is scal ...

EPFL2016

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

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Graph Chatbot

Chat with Graph Search

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

Efficient Algorithms for the Data Exchange Problem

Parallelizing Query Optimization on Shared-Nothing Architectures

From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization

Memetic Viability Evolution for Constrained Optimization

Reliable and Real-Time Distributed Abstractions

Approximation algorithms for geometric dispersion

Complexity Constrained Representation Selection for Dynamic Adaptive Streaming

Riemannian Optimization for Solving High-Dimensional Problems with Low-Rank Tensor Structure

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

Efficient Algorithms for the Data Exchange Problem

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

From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization

Parallelizing Query Optimization on Shared-Nothing Architectures

Complexity Constrained Representation Selection for Dynamic Adaptive Streaming

Reliable and Real-Time Distributed Abstractions

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

Memetic Viability Evolution for Constrained Optimization

Approximation algorithms for geometric dispersion

Riemannian Optimization for Solving High-Dimensional Problems with Low-Rank Tensor Structure