Publication

A Propagation/Local Search Hybrid for Distributed Optimization

Related publications (47)

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.

Independence number of generalized Petersen graphs

Javad Ebrahimi Boroojeni

Determining the size of a maximum independent set of a graph G, denoted by alpha(G), is an NP-hard problem. Therefore many attempts are made to find upper and lower bounds, or exact values of alpha(G) for special classes of graphs. This paper is aimed towa ...

Charles Babbage Res Ctr2016

Principled Parallel Mean-Field Inference for Discrete Random Fields

Pascal Fua, François Fleuret, Pierre Bruno Baqué, Timur Bagautdinov

Mean-field variational inference is one of the most popular approaches to inference in discrete random fields. Standard mean-field optimization is based on coordinate descent and in many situations can be impractical. Thus, in practice, various parallel te ...

2016

A Precise Threshold For Quasi-Ramsey Numbers

János Pach

We consider the variation of Ramsey numbers introduced by Erdos and Pach [J. Graph Theory, 7 (1983), pp. 137-147], where instead of seeking complete or independent sets we only seek a t-homogeneous set, a vertex subset that induces a subgraph of minimum de ...

Siam Publications2015

Approximation methods for large-scale spatial queueing systems

Nikolaos Geroliminis, Burak Boyaci

Different than the conventional queueing systems, in spatial queueing systems (SQS) the service rate for each customer-server pairs differs and the server that intervenes for a specific customer is not known a priori, depending on the availability of serve ...

Pergamon-Elsevier Science Ltd2015

Kullback-Leibler Proximal Variational Inference

Pascal Fua, François Fleuret, Pierre Bruno Baqué, Mohammad Emtiyaz Khan

We propose a new variational inference method based on a proximal framework that uses the Kullback-Leibler (KL) divergence as the proximal term. We make two contributions towards exploiting the geometry and structure of the variational bound. Firstly, we p ...

2015

A Decision Procedure for (Co)datatypes in SMT Solvers

Andrew Joseph Reynolds

We present a decision procedure that combines reasoning about datatypes and codatatypes. The dual of the acyclicity rule for datatypes is a uniqueness rule that identifies observationally equal codatatype values, including cyclic values. The procedure deci ...

Springer-Verlag Berlin2015

Statistics of Extremes

Anthony Christopher Davison, Raphaël Huser

Statistics of extremes concerns inference for rare events. Often the events have never yet been observed, and their probabilities must therefore be estimated by extrapolation of tail models fitted to available data. Because data concerning the event of int ...

Annual Reviews2015

Constrained Binary Identification Problem

Amin Karbasi, Morteza Zadimoghaddam

We consider the problem of building a binary decision tree, to locate an object within a set by way of the least number of membership queries. This problem is equivalent to the “20 questions game” of information theory and is closely related to lossless so ...

2013

Automated Reconstruction of Curvilinear Networks from 2D and 3D Imagery

Engin Türetken

Reconstructing complex curvilinear structures such as neural circuits, road networks, and blood vessels is a key challenge in many scientific and engineering fields. It has a broad range of applications, from the delineation of micrometer-sized neurons in ...

EPFL2013

The robust single machine scheduling problem with uncertain release and processing times

Michel Bierlaire, Nitish Umang

In this work, we study the single machine scheduling problem with uncertain release times and processing times of jobs. We adopt a robust scheduling approach, in which the measure of robustness to be minimized for a given sequence of jobs is the worst-case ...

2013