Concept

Distance correlation

Publications associées (65)

Accelerated T(2)Mapping of the Lumbar Intervertebral Disc Highly Undersampled K-Space Data for Robust T(2)Relaxation Time Measurement in Clinically Feasible Acquisition Times

Tobias Kober, Tom Hilbert, Michael Weber

Objectives T(2)mapping of the intervertebral disc (IVD) can depict quantitative changes reflecting biochemical change due to loss of glycosaminoglycan content. Conventional T(2)mapping is usually performed using a 2-dimensional multi-echo-spin echo sequenc ...

2020

Uncertainty and sensitivity analysis of PWR mini-core transients in the presence of nuclear data uncertainty using non-parametric tolerance limits

Andreas Pautz, Winfried Zwermann, Alexander Aures

The impact of nuclear data uncertainties is studied for the reactor power and the reactivity during control rod withdrawal transients with reactivity insertions of 0.5

and 0.97

, respectively, for a PWR mini-core model. Multi-group cross sections, the mul ...

PERGAMON-ELSEVIER SCIENCE LTD2020

Strong convergence of multivariate maxima

Simone Padoan, Stefano Rizzelli

It is well known and readily seen that the maximum of n independent and uniformly on [0, 1] distributed random variables, suitably standardised, converges in total variation distance, as n increases, to the standard negative exponential distribution. We ex ...

CAMBRIDGE UNIV PRESS2020

Mixed scalar-current bootstrap in three dimensions

Alessandro Vichi, Marten Jan Reehorst

We study the mixed system of correlation functions involving a scalar field charged under a global U(1) symmetry and the associated conserved spin-1 current J(mu). Using numerical bootstrap techniques we obtain bounds on new observables not accessible in t ...

SPRINGER2020

Pairwise Comparisons with Flexible Time-Dynamics

Matthias Grossglauser, Lucas Maystre, Victor Kristof

Inspired by applications in sports where the skill of players or teams competing against each other varies over time, we propose a probabilistic model of pairwise-comparison outcomes that can capture a wide range of time dynamics. We achieve this by replac ...

ASSOC COMPUTING MACHINERY2019

Interactive Generation of Calligraphic Trajectories from Gaussian Mixtures

Sylvain Calinon

The chapter presents an approach for the interactive definition of curves and motion paths based on Gaussian mixture model (GMM) and optimal control. The input of our method is a mixture of multivariate Gaussians defined by the user, whose centers define a ...

Springer2019

Recovering covariance from functional fragments

Victor Panaretos, Marie-Hélène Descary

We consider nonparametric estimation of a covariance function on the unit square, given a sample of discretely observed fragments of functional data. When each sample path is observed only on a subinterval of length , one has no statistical information on ...

2019

Novel Algorithms For Clustering

James Peter Newling

Clustering is a method for discovering structure in data, widely used across many scientific disciplines. The two main clustering problems this dissertation considers are K-means and K-medoids. These are NP-hard problems in the number of samples and cluste ...

EPFL2018

Computational aspects of correlation power analysis

Joppe Willem Bos, Paul Bottinelli

Since the discovery of simple power attacks, the cryptographic research community has developed significantly more advanced attack methods. The idea behind most algorithms remains to perform a statistical analysis by correlating the power trace obtained wh ...

Springer Heidelberg2017

An Inner-Product Calculus for Periodic Functions and Curves

Michaël Unser, Daniel Andreas Schmitter, Anaïs Laure Marie-Thérèse Badoual

Our motivation is the design of efficient algorithms to process closed curves represented by basis functions or wavelets. To that end, we introduce an inner-product calculus to evaluate correlations and

L _{ 2 }

distances between such curves. In partic ...

2016

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