Publication

MATHICSE Technical Report : An algorithm for computing minimal Geršgorin sets

Related publications (33)

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.

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

We consider the previously unsolved problem of sampling paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all paths and he ...

2013

Effective Enrichment of Gene Expression Data Sets

Utku Sirin

The ever-growing need for gene-expression data analysis motivates studies in sample generation due to the lack of enough gene-expression data. It is common that there are thousands of genes but only tens or rarely hundreds of samples available. In this pap ...

2012

Adaptive conformational sampling based on replicas

Jérémy Curuksu

Computer simulations of biomolecules such as molecular dynamics simulations are limited by the time scale of conformational rearrangements. Several sampling techniques are available to search the multi-minima free energy landscape but most efficient, time- ...

Springer-Verlag2012

Young firms and innovation: A microeconometric analysis

Gabriele Pellegrino

This paper discusses the sources of product innovation in young innovative companies (YICs), here defined as firms engaged in product innovation and with less than 8 years of activity. In particular, we look at in-house and external R&D and at the acquisit ...

2012

Sensor Networks for Diffusion Fields: Detection of Sources in Space and Time

Martin Vetterli, Ivan Dokmanic, Juri Ranieri, Amina Chebira

Abstract—We consider the problem of reconstructing a diffusion field, such as temperature, from samples collected by a sensor network. Motivated by the fast decay of the eigenvalues of the diffusion equation, we approximate the field by a truncated series. ...

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

2011

Metropolis-Hastings sampling of paths

Michel Bierlaire, Gunnar Flötteröd

We consider the previously unsolved problem of sampling cycle-free paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all p ...

2011

Distributed Sampling of Signals Linked by Sparse Filtering: Theory and Applications

Martin Vetterli, Olivier Roy, Yue Lu, Ali Hormati

We study the distributed sampling and centralized reconstruction of two correlated signals, modeled as the input and output of an unknown sparse filtering operation. This is akin to a Slepian-Wolf setup, but in the sampling rather than the lossless compres ...

2010

Metropolis-Hastings sampling of alternatives for route choice models

Michel Bierlaire, Gunnar Flötteröd

Sampling of alternatives has been shown to be an operational technique for the estimation of route choice models. In order to apply it, the sampling protocol generating paths must be such that the sampling probability is known, in order to correct for the ...

2010