Concept

Divide-and-conquer algorithm

Related publications (346)

Centrality of Trees for Capacitated k-Center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated k-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) k locations (called centers) and assign e ...

Springer2014

Power Electronic Traction Transformer: Efficiency Improvements Under Light-Load Conditions

Drazen Dujic, Akos Mester

Power electronic transformer (PET), a converter technology that utilizes power semiconductors in combination with medium-frequency transformers, is considered a promising solution for certain applications requiring flexible galvanic isolation. Among are th ...

2014

LP-Based Algorithms for Capacitated Facility Location

Ola Nils Anders Svensson, Hyung Chan An

Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem. A variety of algorithmic methodo ...

IEEE2014

Parallel symbolic execution on cluster of commodity hardware

George Candea, Cristian Zamfir, Stefan Bucur

A symbolic execution task is dynamically divided among multiple computing nodes. Each of the multiple computing nodes explores a different portion of a same symbolic execution tree independently of other computing nodes. Workload status updates are receive ...

2014

Fine-Tunning a MAP Error Corrections Algorithm for Five-Key Chording Keyboards

Pierre Dillenbourg, Bixio Rimoldi, Adrian Dan Tarniceriu

Different typing devices lead to different typing error patterns. In addition, different persons using the same device have different error patterns. Considering this, we propose and evaluate a spelling algorithm specifically designed for a five-key chordi ...

2014

Development of real-time plasma analysis and control algorithms for the TCV tokamak using SIMULINK

Olivier Sauter, Basil Duval, Stefano Coda, Timothy Goodman, Jean-Marc Moret, Federico Alberto Alfredo Felici, Alexander Karpushov, Wouter Vijvers, Alessandro Bortolon, James Paley, Lucia Isabel Federspiel, Francesco Piras, Hoang Bao Le, Andreas Pitzschke

One of the key features of the new digital plasma control system installed on the TCV tokamak is the possibility to rapidly design, test and deploy real-time algorithms. With this flexibility the new control system has been used for a large number of new e ...

Elsevier Science Sa2014

Cracking The Complexity Of Fixed-Point Refinement In Complex Wireless Systems

Paolo Ienne, David Novo Bruna

Fixed-point arithmetic leads to efficient implementations. However, the optimization process required to size each of the implementation signals can be prohibitively complex. In this paper, we introduce a new divide-and-conquer method that is able to appro ...

Ieee2013

Geometric Variational Models for Inverse Problems in Imaging

Virginia Estellers Casas

This dissertation develops geometric variational models for different inverse problems in imaging that are ill-posed, designing at the same time efficient numerical algorithms to compute their solutions. Variational methods solve inverse problems by the fo ...

EPFL2013

New Bounds for Random Constraint Satisfaction Problems via Spatial Coupling

Rüdiger Urbanke, Nicolas Macris, Seyed Hamed Hassani

This paper is about a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial Coupling was recently invented in the area of error correcting codes where it has resulted in effici ...

2013

Thermodynamics-based Significance Ranking of Candidates for Metabolomics

Vassily Hatzimanikatis

Integration of experimental measurements of intracellular metabolite concentrations in genome scale models restricts the thermodynamically feasible flux space and reduces uncertainty regarding the net outcome of by-directional reactions. By combining tFBA, ...

2013

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.