Publication

Stable high-order randomized cubature formulae in arbitrary dimension

Publications associées (52)

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

Invariant generation for P-solvable loops with assignments

Laura Ildiko Kovacs

We discuss interesting properties of a general technique for inferring polynomial invariants for a subfamily of imperative loops, called the P-solvable loops, with assignments only. The approach combines algorithmic combinatorics, polynomial algebra and co ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Exploiting Contextual Information for Speech/Non-Speech Detection

Petr Motlicek, Hynek Hermansky, Sree Hari Krishnan Parthasarathi

In this paper, we investigate the effect of temporal context for speech/non-speech detection (SND). It is shown that even a simple feature such as full-band energy, when employed with a large-enough context, shows promise for further investigation. Experim ...

Springer-Verlag Berlin, Heidelberg2008

Exploiting contextual information for speech/non-speech detection

Hynek Hermansky, Sree Hari Krishnan Parthasarathi

IDIAP2008

Propriétés fines des trajectoires du mouvement brownien fractionnaire

Driss Baraka

Let X = {X(t); t ∈ RN} be a (N,d) fractional Brownian motion in Rd of index H ∈ (0,1). We study the local time of X for all temporal dimensions N and spatial dimensions d for which local time exist. We obtain two main results : R1. If we denote by Lx(I) th ...

EPFL2008

Exploiting temporal context for speech/non-speech detection

Petr Motlicek, Hynek Hermansky, Sree Hari Krishnan Parthasarathi

IDIAP2008

Capacity upper bounds for the deletion channel

Suhas Diggavi, Henry Pfister

We present two upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. The first can be numerically evaluated for any fixed d. The second provides an asymptotic upper bound as ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Oscillating fracture paths in thin elastic sheets: when geometry rules the fracture path

Pedro Miguel Nunes Pereira de Almeida Reis

We report a novel mode of quasi-static oscillatory crack propagation when a cutting tool is driven through a thin polymer film [6,7]. In our experiments, for tools with a large enough width, the crack tip follows a highly periodic path, leaving behind a st ...

2006

A tutorial on (Bayesian) probability

Claudio Mattiussi

The aim of this tutorial is to show that, when properly formulated, probability theory is simply the science of plausible reasoning, which permits us to represent exactly and to update our state of information about the world. This is nothing new, since in ...

2005

Semi-analytical bifurcation analysis of two-phase flow in a heated channel

Rakesh Chawla, Abdelhamid Dokhane

Using a drift flux representation for the two-phase flow, a new reduced order model has been developed to simulate density-wave oscillations (DWOs) in a heated channel. This model is then used to perform stability and semi-analytical bifurcation analysis, ...

2005

The Scrambled Net Filter

Thomas Gsponer

The standard Kalman filter is a powerful and widely used tool to perform prediction, filtering and smoothing in the fields of linear Gaussian state-space models. In its standard setting it has a simple recursive form which implies high computational effici ...

2002