Publications related to Divide-and-conquer algorithm

Near-Optimally Teaching the Crowd to Classify

Andreas Krause, Amin Karbasi, Ilija Bogunovic

How should we present training examples to learners to teach them classification rules? This is a natural problem when training workers for crowdsourcing labeling tasks, and is also moti- vated by challenges in data-driven online educa- tion. We propose a ...

2014

Interface control domain decomposition methods for heterogeneous problems

Alfio Quarteroni, Marco Discacciati

This paper is concerned with the solution of heterogeneous problems by the interface control domain decomposition (ICDD) method, a strategy introduced for the solution of partial differential equations in computational domains partitioned into subdomains t ...

Wiley-Blackwell2014

An Efficient Manipulation Package for Biconditional Binary Decision Diagrams

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

Biconditional Binary Decision Diagrams (BBDDs) are a novel class of binary decision diagrams where the branching condition, and its associated logic expansion, is biconditional on two variables. Reduced and ordered BBDDs are remarkably compact and unique f ...

IEEE2014

Efficient Subnetwork Selection in Relay Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

We consider a source that would like to communicate with a destination over a layered Gaussian relay network. We present a computationally efficient method that enables to select a near-optimal (in terms of throughput) subnetwork of a given size connecting ...

2014

Efficient Subnetwork Selection in Relay Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

Ieee2014

A Branch-and-Price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports

Michel Bierlaire, Tomas Robenek, Nitish Umang

In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem ...

Elsevier Science Bv2014

Improved Estimation of the Specific Differential Phase Shift Using a Compilation of Kalman Filter Ensembles

Alexis Berne, Jacopo Grazioli, Marc Schneebeli Zeugin

A new algorithm for the accurate estimation of the specific differential phase shift on propagation (K-dp) from noisy total differential phase shift (Psi(dp)) measurements is presented for data acquired with a polarimetric weather radar. The new approach, ...

Institute of Electrical and Electronics Engineers2014

Convex Optimization Approaches for Blind Sensor Calibration using Sparsity

Rémi Gribonval, Gilles Puy

We investigate a compressive sensing framework in which the sensors introduce a distortion to the measurements in the form of unknown gains. We focus on blind calibration, using measures performed on multiple unknown (but sparse) signals and formulate the ...

Institute of Electrical and Electronics Engineers2014

On the development and evaluation of spatial domain Green Functions for multilayered structures with conductive sheets

Juan Ramon Mosig, Michael Mattes, Ioannis Koufogiannis

This work focuses on Green Functions (GFs) of planar multilayered structures that may include arbitrary number of conductive sheets. The spectral domain GFs are derived through an automatized strategy based on the propagator matrix technique, while the spa ...

2014

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.

Divide-and-conquer algorithm

Near-Optimally Teaching the Crowd to Classify

Interface control domain decomposition methods for heterogeneous problems

An Efficient Manipulation Package for Biconditional Binary Decision Diagrams

Efficient Subnetwork Selection in Relay Networks

Efficient Subnetwork Selection in Relay Networks

A Branch-and-Price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports

Improved Estimation of the Specific Differential Phase Shift Using a Compilation of Kalman Filter Ensembles

Approximation Schemes for Many-Objective Query Optimization

Convex Optimization Approaches for Blind Sensor Calibration using Sparsity

On the development and evaluation of spatial domain Green Functions for multilayered structures with conductive sheets

Graph Chatbot

Chat with Graph Search

Near-Optimally Teaching the Crowd to Classify

Interface control domain decomposition methods for heterogeneous problems

An Efficient Manipulation Package for Biconditional Binary Decision Diagrams

Efficient Subnetwork Selection in Relay Networks

Efficient Subnetwork Selection in Relay Networks

A Branch-and-Price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports

Improved Estimation of the Specific Differential Phase Shift Using a Compilation of Kalman Filter Ensembles

Approximation Schemes for Many-Objective Query Optimization

Convex Optimization Approaches for Blind Sensor Calibration using Sparsity

On the development and evaluation of spatial domain Green Functions for multilayered structures with conductive sheets