Publications associées à P-adic valuation

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

The control of the scaled false discovery rate, a flexible and comprehensive error control and a powerful theoretical tool in multiple testing

Dimitri Nestor Alice Van De Ville, Stephan Morgenthaler, Djalel Eddine Meskaldji

Given the large number of papers written over the last ten years on error controls in high dimensional multiple testing, it would be worthwhile to consider a single comprehensive technique that allows user flexibility in error control when dealing with big ...

2015

Utility Metrics Specifications. OpenIoT Deliverable D422

Jean Paul Calbimonte Perez, Mehdi Riahi

This deliverable specifies the utility metrics that are considered and used in the scope of the OpenIoT project. These utility metrics are recorded as part of the implementation of the Utility Manager component of the OpenIoT platform, while they have also ...

2014

Spaces With Noetherian Cohomology

Jérôme Scherer

Is the cohomology of the classifying space of a p-compact group, with Noetherian twisted coefficients, a Noetherian module? In this paper we provide, over the ring of p-adic integers, such a generalization to p-compact groups of the Evens-Venkov Theorem. W ...

Cambridge University Press2013

Some Thoughts on Robustness and Multiple Testing

Stephan Morgenthaler, Djalel Eddine Meskaldji

When testing many null hypotheses, deciding which of them to reject is a subtle game. The prevailing approach consists in deciding on a level and type of control against false rejections (errors of type I) and subject to this constraint to maximize the num ...

2012

Adaptive Strategy for the Statistical Analysis of Connectomes

Jean-Philippe Thiran, Stephan Morgenthaler, Reto Meuli, Patric Hagmann, Djalel Eddine Meskaldji, Leila Cammoun

We study an adaptive statistical approach to analyze brain networks represented by brain connection matrices of interregional connectivity (connectomes). Our approach is at a middle level between a global analysis and single connections analysis by conside ...

Public Library of Science2011

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.

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

P-adic valuation

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

The control of the scaled false discovery rate, a flexible and comprehensive error control and a powerful theoretical tool in multiple testing

Utility Metrics Specifications. OpenIoT Deliverable D422

Spaces With Noetherian Cohomology

Some Thoughts on Robustness and Multiple Testing

Adaptive Strategy for the Statistical Analysis of Connectomes

On the computational complexity of periodic scheduling

Estimation of value of travel-time savings using Mixed Logit models

Graph Chatbot

Chattez avec Graph Search

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

The control of the scaled false discovery rate, a flexible and comprehensive error control and a powerful theoretical tool in multiple testing

Utility Metrics Specifications. OpenIoT Deliverable D422

Adaptive Strategy for the Statistical Analysis of Connectomes

Spaces With Noetherian Cohomology

Estimation of value of travel-time savings using Mixed Logit models

On the computational complexity of periodic scheduling

Some Thoughts on Robustness and Multiple Testing