Concept

Estimation par noyau

Publications associées (186)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Lazy Asynchronous I/O for Event-Driven Servers

Willy Zwaenepoel

In this paper , we introduce Lazy Asynchronous I/O (LAIO),a new API for performing I/O that is well-suited but not limited to the needs of high-performance, event-driven servers. In addition, we describe and evaluate an implementation of LAIO that demonstr ...

2004

Variational Information Maximization in Gaussian Channels

Recently, we introduced a simple variational bound on mutual information, that resolves some of the difficulties in the application of information theory to machine learning. Here we study a specific application to Gaussian channels. It is well known that ...

IDIAP2004

Wavelet and footprint sampling of signals with a finite rate of innovation

Martin Vetterli, Pier Luigi Dragotti

In this paper, we consider classes of not bandlimited signals, namely, streams of Diracs and piecewise polynomial signals, and show that these signals can be sampled and perfectly reconstructed using wavelets as sampling kernel. Due to the multiresolution ...

2004

High-Quality Causal Interpolation for Online Unidimensional Signal Processing

Michaël Unser, Philippe Thévenaz, Thierry Blu

We present a procedure for designing interpolation kernels that are adapted to time signals; i.e., they are causal, even though they do not have a finite support. The considered kernels are obtained by digital IIR filtering of a finite support function tha ...

EURASIP2004

Local parametric analysis of derivatives pricing and hedging

A novel methodology for the analysis of derivatives pricing in incomplete markets is tested empirically. The methodology generates hedge ratios and derivatives prices. They are estimated from the correlation structure between the local co-movements of secu ...

2003

Density limits in helium plasmas at JET

Richard Pitts

Recently at JET a pure helium campaign has been performed. The exploration of the density limit in L-mode limiter as well as L-mode and H-mode diverted plasmas was one of the main objectives. In L-mode plasmas the density can be increased until the total r ...

2003

Sampling method reconstruction method and devices for sampling and/or reconstructing multidimensional signals

Martin Vetterli, Irena Maravic, Pier Luigi Dragotti

Reconstruction method and devices for two-dimensional signals that are not bandlimited but have a parametric representation with a finite number of degrees of freedom. The signal is reconstructed from the samples obtained after a suitable filtering with a ...

2003

From Samples to Objects in Kernel Methods

Samy Bengio, Alexei Pozdnoukhov

This paper presents a general method for incorporating prior knowledge into kernel methods. It applies when the prior knowledge can be formalized by the description of an object around each sample of the training set, assuming that all points in the given ...

IDIAP2003

Online processing of multiple inputs in a sparsely-connected recurrent neural network

Wulfram Gerstner, Julien Mayor

The storage and short-term memory capacities of recurrent neural networks of spiking neurons are investigated. We demonstrate that it is possible to process online many superimposed streams of input. This is despite the fact that the stored information is ...

Springer2003

Multiresolution Moment Filters

Michaël Unser, Michael Sühling, Muthuvel Arigovindan

We define multi-scale moments that are estimated locally by analyzing the image through a sliding window at multiple scales. When the analysis window satisfies a two-scale relation, we prove that these moments can be computed very efficiently using a multi ...

IEEE2002