Publication

Random sampling of bandlimited signals on graphs

Related publications (210)

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.

Liquid-Quench Sampling System for the Analysis of Gas Streams from Biomass Gasification Processes. Part 2: Sampling Condensable Compounds

Christian Ludwig, Tilman J. Schildhauer

The performance of a continuous liquid-quench-based sampling system is presented, with regard to the sampling of condensable compounds. Toluene is used as a model molecule representing tars commonly found in the gas streams of biomass gasification plants a ...

Amer Chemical Soc2012

Learning Ridge Functions With Randomized Sampling In High Dimensions

Volkan Cevher, Hemant Tyagi

We study the problem of learning ridge functions of the form f(x) = g(aT x), x ∈ ℝd, from random samples. Assuming g to be a twice continuously differentiable function, we leverage techniques from low rank matrix recovery literature to derive a uniform app ...

IEEE2012

On the Bandwidth of the Plenoptic Function

Martin Vetterli, Minh Do, Davy Marchand-Maillet

The plenoptic function (POF) provides a powerful conceptual tool for describing a number of problems in image/video processing, vision, and graphics. For example, image based-rendering can be seen as sampling and interpolation of the POF. In such applicati ...

Institute of Electrical and Electronics Engineers2012

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

OptiMoS: Optimal Sensing for Mobile Sensors

Karl Aberer, Julien Eberle, Zhixian Yan

Both sensor coverage maximization and energy cost minimization are the fundamental requirements in the design of real-life mobile sensing applications, e.g., (1) deploying environ- mental sensors (like CO2, fine particle measurement) on public transports t ...

2012

Test Results of ITER Correction Coil Short Samples CCCN1 and CCCN2

Pierluigi Bruzzone

This paper presents the first benchmarking test results of ITER correction coil (CC) conductor short samples CCCN1 and CCCN2. The Chinese first CC conductor short sample CCCN1 was prepared and tested at the Institute of Plasma Physics, Chinese Academy of S ...

American Nuclear Society2012

Fast and Robust Parametric Estimation of Jointly Sparse Channels

Martin Vetterli, Yann Barbotin

We consider the joint estimation of multipath channels obtained with a set of receiving antennas and uniformly probed in the frequency domain. This scenario fits most of the modern outdoor communication protocols for mobile access (ETSI Std. 125 913) or di ...

2012

Clock Jitter Compensation in High-Rate ADC Circuits

Ali H. Sayed

Clock timing jitter refers to random perturbations in the sampling time in analog-to-digital converters (ADCs). The perturbations are caused by circuit imperfections in the sampling clock. This paper analyzes the effect of sampling clock jitter on the acqu ...

IEEE2012

Robust algorithm for aligning two-dimensional chromatograms

Jeremy Samuel Arey, Jonas Gros, Petros Dimitriou Christidis, Rebecca Rutler, Deedar Nabi

Comprehensive, two-dimensional gas chromatography (GC x GC) chromatogram's typically exhibit run-to-run retention time variability. Chromatogram alignment is often a desirable step prior to further analysis of the data, for example, in studies of environme ...

Amer Chemical Soc2012

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 ...

2011